./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.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/chl-node-symm.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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:50:14,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:50:14,337 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:50:14,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:50:14,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:50:14,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:50:14,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:50:14,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:50:14,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:50:14,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:50:14,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:50:14,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:50:14,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:50:14,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:50:14,363 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:50:14,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:50:14,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:50:14,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:14,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:14,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:14,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:50:14,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:50:14,365 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-01-10 06:50:14,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:50:14,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:50:14,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:50:14,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:50:14,621 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:50:14,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-01-10 06:50:15,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31521952e/01b5fec8960048feb3850695eb8fb3b6/FLAG8b59d5957 [2025-01-10 06:50:16,053 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:50:16,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-01-10 06:50:16,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31521952e/01b5fec8960048feb3850695eb8fb3b6/FLAG8b59d5957 [2025-01-10 06:50:16,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31521952e/01b5fec8960048feb3850695eb8fb3b6 [2025-01-10 06:50:16,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:50:16,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:50:16,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:16,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:50:16,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:50:16,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3099d151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16, skipping insertion in model container [2025-01-10 06:50:16,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:50:16,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:16,572 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:50:16,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:16,614 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:50:16,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16 WrapperNode [2025-01-10 06:50:16,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:16,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:16,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:50:16,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:50:16,621 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:50:16" (1/1) ... [2025-01-10 06:50:16,627 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:50:16" (1/1) ... [2025-01-10 06:50:16,654 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 325 [2025-01-10 06:50:16,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:16,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:50:16,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:50:16,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:50:16,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,692 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-01-10 06:50:16,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:50:16,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:50:16,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:50:16,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:50:16,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (1/1) ... [2025-01-10 06:50:16,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:16,754 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:50:16,757 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:50:16,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:50:16,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:50:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:50:16,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:50:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:50:16,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:50:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:50:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:50:16,774 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:50:16,856 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:50:16,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:50:17,239 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:50:17,240 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:50:17,509 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:50:17,509 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:50:17,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:17 BoogieIcfgContainer [2025-01-10 06:50:17,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:50:17,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:50:17,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:50:17,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:50:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:50:16" (1/3) ... [2025-01-10 06:50:17,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340d0f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:17, skipping insertion in model container [2025-01-10 06:50:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:16" (2/3) ... [2025-01-10 06:50:17,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340d0f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:17, skipping insertion in model container [2025-01-10 06:50:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:17" (3/3) ... [2025-01-10 06:50:17,515 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-01-10 06:50:17,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:50:17,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 88 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-01-10 06:50:17,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:50:17,597 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:50:17,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 97 transitions, 208 flow [2025-01-10 06:50:17,653 INFO L124 PetriNetUnfolderBase]: 10/95 cut-off events. [2025-01-10 06:50:17,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:50:17,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 10/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 234 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-01-10 06:50:17,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 97 transitions, 208 flow [2025-01-10 06:50:17,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 94 transitions, 200 flow [2025-01-10 06:50:17,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:50:17,674 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;@2508afea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:50:17,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-10 06:50:17,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:50:17,676 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 06:50:17,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:50:17,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:17,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 06:50:17,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:17,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash 32204, now seen corresponding path program 1 times [2025-01-10 06:50:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498209885] [2025-01-10 06:50:17,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:50:17,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:50:17,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:17,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:17,840 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:50:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498209885] [2025-01-10 06:50:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498209885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099953817] [2025-01-10 06:50:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:17,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:17,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:17,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:17,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:17,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:17,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:17,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:18,085 INFO L124 PetriNetUnfolderBase]: 285/731 cut-off events. [2025-01-10 06:50:18,086 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-10 06:50:18,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 731 events. 285/731 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4317 event pairs, 176 based on Foata normal form. 4/575 useless extension candidates. Maximal degree in co-relation 1096. Up to 450 conditions per place. [2025-01-10 06:50:18,093 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 41 selfloop transitions, 1 changer transitions 2/90 dead transitions. [2025-01-10 06:50:18,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 278 flow [2025-01-10 06:50:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2025-01-10 06:50:18,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:50:18,107 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 200 flow. Second operand 3 states and 194 transitions. [2025-01-10 06:50:18,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 278 flow [2025-01-10 06:50:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:18,119 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 181 flow [2025-01-10 06:50:18,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2025-01-10 06:50:18,126 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-01-10 06:50:18,127 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 181 flow [2025-01-10 06:50:18,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:18,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:50:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:50:18,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 999301, now seen corresponding path program 1 times [2025-01-10 06:50:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614128618] [2025-01-10 06:50:18,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:18,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:50:18,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:50:18,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:18,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,202 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:50:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:18,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614128618] [2025-01-10 06:50:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614128618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:18,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591975436] [2025-01-10 06:50:18,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:18,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:18,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:18,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:18,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:18,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:18,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:18,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:18,360 INFO L124 PetriNetUnfolderBase]: 285/727 cut-off events. [2025-01-10 06:50:18,361 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 06:50:18,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 727 events. 285/727 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4295 event pairs, 176 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1180. Up to 447 conditions per place. [2025-01-10 06:50:18,369 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-01-10 06:50:18,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 257 flow [2025-01-10 06:50:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-01-10 06:50:18,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-01-10 06:50:18,373 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 181 flow. Second operand 3 states and 189 transitions. [2025-01-10 06:50:18,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 257 flow [2025-01-10 06:50:18,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:18,376 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 178 flow [2025-01-10 06:50:18,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-01-10 06:50:18,376 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2025-01-10 06:50:18,377 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 178 flow [2025-01-10 06:50:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:18,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:18,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:50:18,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:50:18,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 960360426, now seen corresponding path program 1 times [2025-01-10 06:50:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548189517] [2025-01-10 06:50:18,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:18,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:50:18,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:50:18,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,503 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:50:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548189517] [2025-01-10 06:50:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548189517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868077891] [2025-01-10 06:50:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:18,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:18,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:18,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:18,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:18,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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:50:18,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:18,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:18,676 INFO L124 PetriNetUnfolderBase]: 287/735 cut-off events. [2025-01-10 06:50:18,676 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 06:50:18,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 735 events. 287/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4329 event pairs, 176 based on Foata normal form. 2/577 useless extension candidates. Maximal degree in co-relation 1198. Up to 454 conditions per place. [2025-01-10 06:50:18,680 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 42 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-01-10 06:50:18,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 290 flow [2025-01-10 06:50:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-01-10 06:50:18,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-01-10 06:50:18,682 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 178 flow. Second operand 4 states and 250 transitions. [2025-01-10 06:50:18,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 290 flow [2025-01-10 06:50:18,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:18,689 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 235 flow [2025-01-10 06:50:18,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2025-01-10 06:50:18,690 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-01-10 06:50:18,690 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 235 flow [2025-01-10 06:50:18,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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:50:18,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:18,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:50:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:50:18,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 960360474, now seen corresponding path program 1 times [2025-01-10 06:50:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3973934] [2025-01-10 06:50:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:50:18,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:50:18,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,736 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:50:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3973934] [2025-01-10 06:50:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3973934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:18,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:18,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094942224] [2025-01-10 06:50:18,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:18,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:18,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:18,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:18,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:18,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:18,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:50:18,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:18,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:18,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:18,885 INFO L124 PetriNetUnfolderBase]: 287/733 cut-off events. [2025-01-10 06:50:18,886 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:50:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 733 events. 287/733 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4324 event pairs, 176 based on Foata normal form. 2/580 useless extension candidates. Maximal degree in co-relation 1218. Up to 455 conditions per place. [2025-01-10 06:50:18,890 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 47 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2025-01-10 06:50:18,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 327 flow [2025-01-10 06:50:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-01-10 06:50:18,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6563573883161512 [2025-01-10 06:50:18,892 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 235 flow. Second operand 3 states and 191 transitions. [2025-01-10 06:50:18,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 327 flow [2025-01-10 06:50:18,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:18,895 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 227 flow [2025-01-10 06:50:18,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2025-01-10 06:50:18,897 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-01-10 06:50:18,897 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 227 flow [2025-01-10 06:50:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:50:18,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:18,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:50:18,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:50:18,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -293595393, now seen corresponding path program 1 times [2025-01-10 06:50:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370318263] [2025-01-10 06:50:18,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:18,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:50:18,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:50:18,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:18,963 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:50:18,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:18,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370318263] [2025-01-10 06:50:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370318263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242711790] [2025-01-10 06:50:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:18,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:18,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:18,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:50:18,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:18,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:18,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:19,087 INFO L124 PetriNetUnfolderBase]: 287/731 cut-off events. [2025-01-10 06:50:19,088 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 06:50:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 731 events. 287/731 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4301 event pairs, 176 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 1210. Up to 453 conditions per place. [2025-01-10 06:50:19,095 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-01-10 06:50:19,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 315 flow [2025-01-10 06:50:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-01-10 06:50:19,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-01-10 06:50:19,097 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 227 flow. Second operand 3 states and 189 transitions. [2025-01-10 06:50:19,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 315 flow [2025-01-10 06:50:19,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:19,099 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 224 flow [2025-01-10 06:50:19,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2025-01-10 06:50:19,099 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -7 predicate places. [2025-01-10 06:50:19,099 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 224 flow [2025-01-10 06:50:19,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:50:19,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:19,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:19,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:50:19,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:19,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1321300851, now seen corresponding path program 1 times [2025-01-10 06:50:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81154304] [2025-01-10 06:50:19,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:19,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:19,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:19,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:19,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81154304] [2025-01-10 06:50:19,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81154304] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622845438] [2025-01-10 06:50:19,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:19,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:19,223 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:50:19,225 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:50:19,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:19,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:19,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:19,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:19,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:50:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622845438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:50:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:50:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553687084] [2025-01-10 06:50:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:19,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:50:19,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:19,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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:50:19,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:19,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:19,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:19,527 INFO L124 PetriNetUnfolderBase]: 287/729 cut-off events. [2025-01-10 06:50:19,527 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 06:50:19,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 729 events. 287/729 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4293 event pairs, 176 based on Foata normal form. 2/575 useless extension candidates. Maximal degree in co-relation 1208. Up to 444 conditions per place. [2025-01-10 06:50:19,532 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 34 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2025-01-10 06:50:19,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 312 flow [2025-01-10 06:50:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-01-10 06:50:19,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5910652920962199 [2025-01-10 06:50:19,534 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 224 flow. Second operand 6 states and 344 transitions. [2025-01-10 06:50:19,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 312 flow [2025-01-10 06:50:19,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:19,536 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 243 flow [2025-01-10 06:50:19,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2025-01-10 06:50:19,536 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-01-10 06:50:19,536 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 243 flow [2025-01-10 06:50:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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:50:19,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:19,537 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:50:19,543 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:50:19,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:19,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1989345563, now seen corresponding path program 1 times [2025-01-10 06:50:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589643062] [2025-01-10 06:50:19,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:19,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:19,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:19,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,837 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:50:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589643062] [2025-01-10 06:50:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589643062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749101071] [2025-01-10 06:50:19,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:19,841 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:50:19,842 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:50:19,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:19,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:19,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:19,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:19,928 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:50:19,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:19,967 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:50:19,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749101071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:19,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:50:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281640663] [2025-01-10 06:50:19,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:19,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:50:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:19,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:50:19,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:50:19,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:19,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 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:50:19,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:19,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:19,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,211 INFO L124 PetriNetUnfolderBase]: 293/753 cut-off events. [2025-01-10 06:50:20,212 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 06:50:20,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 753 events. 293/753 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4456 event pairs, 176 based on Foata normal form. 6/599 useless extension candidates. Maximal degree in co-relation 1300. Up to 458 conditions per place. [2025-01-10 06:50:20,215 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 40 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2025-01-10 06:50:20,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 483 flow [2025-01-10 06:50:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:50:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:50:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-01-10 06:50:20,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-01-10 06:50:20,218 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 243 flow. Second operand 10 states and 562 transitions. [2025-01-10 06:50:20,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 483 flow [2025-01-10 06:50:20,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 423 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:20,224 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 379 flow [2025-01-10 06:50:20,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=379, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-01-10 06:50:20,225 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 3 predicate places. [2025-01-10 06:50:20,225 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 379 flow [2025-01-10 06:50:20,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 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:50:20,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:20,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:20,426 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:50:20,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:20,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1748997228, now seen corresponding path program 1 times [2025-01-10 06:50:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526247753] [2025-01-10 06:50:20,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:50:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:50:20,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:20,495 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:50:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526247753] [2025-01-10 06:50:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526247753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:20,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:20,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304650195] [2025-01-10 06:50:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:20,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:20,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:20,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:20,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:20,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:50:20,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:20,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:20,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,645 INFO L124 PetriNetUnfolderBase]: 295/761 cut-off events. [2025-01-10 06:50:20,645 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-10 06:50:20,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 761 events. 295/761 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4499 event pairs, 176 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 1326. Up to 478 conditions per place. [2025-01-10 06:50:20,650 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 66 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2025-01-10 06:50:20,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 539 flow [2025-01-10 06:50:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-01-10 06:50:20,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-01-10 06:50:20,651 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 379 flow. Second operand 4 states and 250 transitions. [2025-01-10 06:50:20,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 539 flow [2025-01-10 06:50:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 517 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:20,654 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 415 flow [2025-01-10 06:50:20,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2025-01-10 06:50:20,657 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-01-10 06:50:20,657 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 415 flow [2025-01-10 06:50:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:50:20,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,657 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:50:20,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2127119351, now seen corresponding path program 1 times [2025-01-10 06:50:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639315425] [2025-01-10 06:50:20,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:20,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:20,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:20,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:20,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639315425] [2025-01-10 06:50:20,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639315425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:20,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:20,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845355359] [2025-01-10 06:50:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:20,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:20,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:20,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:20,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:20,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:50:20,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:20,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:20,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:20,880 INFO L124 PetriNetUnfolderBase]: 294/760 cut-off events. [2025-01-10 06:50:20,880 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 06:50:20,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 760 events. 294/760 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4481 event pairs, 176 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1333. Up to 474 conditions per place. [2025-01-10 06:50:20,884 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 66 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-01-10 06:50:20,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 549 flow [2025-01-10 06:50:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-01-10 06:50:20,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-01-10 06:50:20,887 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 415 flow. Second operand 4 states and 239 transitions. [2025-01-10 06:50:20,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 549 flow [2025-01-10 06:50:20,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:20,890 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 411 flow [2025-01-10 06:50:20,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2025-01-10 06:50:20,892 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-01-10 06:50:20,892 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 411 flow [2025-01-10 06:50:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:50:20,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:20,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:20,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:50:20,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1061429920, now seen corresponding path program 1 times [2025-01-10 06:50:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291803869] [2025-01-10 06:50:20,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:20,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:50:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:50:20,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:20,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:20,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:20,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291803869] [2025-01-10 06:50:20,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291803869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:20,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:20,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225980601] [2025-01-10 06:50:20,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:20,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:20,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:20,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:20,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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:50:20,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:20,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:20,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:21,091 INFO L124 PetriNetUnfolderBase]: 293/759 cut-off events. [2025-01-10 06:50:21,092 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 06:50:21,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 759 events. 293/759 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4423 event pairs, 176 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 1328. Up to 473 conditions per place. [2025-01-10 06:50:21,095 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 65 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-01-10 06:50:21,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 543 flow [2025-01-10 06:50:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-01-10 06:50:21,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-01-10 06:50:21,097 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 411 flow. Second operand 4 states and 239 transitions. [2025-01-10 06:50:21,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 543 flow [2025-01-10 06:50:21,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:21,099 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 409 flow [2025-01-10 06:50:21,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-01-10 06:50:21,100 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-01-10 06:50:21,100 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 409 flow [2025-01-10 06:50:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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:50:21,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:21,100 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-01-10 06:50:21,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:50:21,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:21,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2033525390, now seen corresponding path program 2 times [2025-01-10 06:50:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205159778] [2025-01-10 06:50:21,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:21,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:50:21,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 06:50:21,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,147 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:50:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205159778] [2025-01-10 06:50:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205159778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453730198] [2025-01-10 06:50:21,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:21,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:21,150 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:50:21,152 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:50:21,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:50:21,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 06:50:21,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:21,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:50:21,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:21,232 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:50:21,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:21,261 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:50:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453730198] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:21,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-01-10 06:50:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437019686] [2025-01-10 06:50:21,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:21,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:21,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:21,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-01-10 06:50:21,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 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:50:21,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:21,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-01-10 06:50:21,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:21,456 INFO L124 PetriNetUnfolderBase]: 293/757 cut-off events. [2025-01-10 06:50:21,457 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 06:50:21,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 757 events. 293/757 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4392 event pairs, 176 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 1319. Up to 453 conditions per place. [2025-01-10 06:50:21,460 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 37 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2025-01-10 06:50:21,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 525 flow [2025-01-10 06:50:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-01-10 06:50:21,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-01-10 06:50:21,462 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 409 flow. Second operand 5 states and 267 transitions. [2025-01-10 06:50:21,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 525 flow [2025-01-10 06:50:21,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 501 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 06:50:21,465 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 427 flow [2025-01-10 06:50:21,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2025-01-10 06:50:21,466 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-01-10 06:50:21,466 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 427 flow [2025-01-10 06:50:21,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 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:50:21,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:21,466 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:21,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:21,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1283129712, now seen corresponding path program 1 times [2025-01-10 06:50:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898793127] [2025-01-10 06:50:21,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:21,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:50:21,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:50:21,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:21,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898793127] [2025-01-10 06:50:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898793127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446488722] [2025-01-10 06:50:21,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:21,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:21,758 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:50:21,759 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:50:21,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:50:21,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:50:21,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:21,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:21,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:21,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:21,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:50:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446488722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:50:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:50:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815456895] [2025-01-10 06:50:21,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:21,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:21,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:50:21,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:21,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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:50:21,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:21,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:21,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:21,989 INFO L124 PetriNetUnfolderBase]: 293/755 cut-off events. [2025-01-10 06:50:21,989 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 06:50:21,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 755 events. 293/755 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4377 event pairs, 176 based on Foata normal form. 2/597 useless extension candidates. Maximal degree in co-relation 1336. Up to 466 conditions per place. [2025-01-10 06:50:21,992 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 56 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2025-01-10 06:50:21,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 104 transitions, 559 flow [2025-01-10 06:50:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-01-10 06:50:21,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5910652920962199 [2025-01-10 06:50:21,994 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 427 flow. Second operand 6 states and 344 transitions. [2025-01-10 06:50:21,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 104 transitions, 559 flow [2025-01-10 06:50:21,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 104 transitions, 497 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:21,996 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 385 flow [2025-01-10 06:50:21,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2025-01-10 06:50:21,996 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2025-01-10 06:50:21,996 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 385 flow [2025-01-10 06:50:21,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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:50:21,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:21,997 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:22,003 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:50:22,197 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,SelfDestructingSolverStorable11 [2025-01-10 06:50:22,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:22,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1122316447, now seen corresponding path program 1 times [2025-01-10 06:50:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346122186] [2025-01-10 06:50:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:50:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:50:22,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:22,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346122186] [2025-01-10 06:50:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346122186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468082421] [2025-01-10 06:50:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:22,291 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:50:22,293 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:50:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:50:22,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:50:22,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:22,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:22,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:50:22,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:22,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:22,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468082421] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:22,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:50:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673170707] [2025-01-10 06:50:22,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:22,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:50:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:22,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:50:22,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:50:22,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:22,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 385 flow. Second operand has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 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:50:22,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:22,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:22,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:22,689 INFO L124 PetriNetUnfolderBase]: 299/779 cut-off events. [2025-01-10 06:50:22,690 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-10 06:50:22,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 779 events. 299/779 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4608 event pairs, 176 based on Foata normal form. 6/621 useless extension candidates. Maximal degree in co-relation 1398. Up to 480 conditions per place. [2025-01-10 06:50:22,693 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 62 selfloop transitions, 26 changer transitions 0/122 dead transitions. [2025-01-10 06:50:22,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 122 transitions, 669 flow [2025-01-10 06:50:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:50:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:50:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-01-10 06:50:22,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-01-10 06:50:22,696 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 385 flow. Second operand 10 states and 562 transitions. [2025-01-10 06:50:22,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 122 transitions, 669 flow [2025-01-10 06:50:22,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 122 transitions, 609 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:22,699 INFO L231 Difference]: Finished difference. Result has 103 places, 122 transitions, 521 flow [2025-01-10 06:50:22,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=521, PETRI_PLACES=103, PETRI_TRANSITIONS=122} [2025-01-10 06:50:22,700 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 12 predicate places. [2025-01-10 06:50:22,700 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 122 transitions, 521 flow [2025-01-10 06:50:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 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:50:22,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:22,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:22,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:22,905 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,SelfDestructingSolverStorable12 [2025-01-10 06:50:22,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 114457507, now seen corresponding path program 1 times [2025-01-10 06:50:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967674250] [2025-01-10 06:50:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:22,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:50:22,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:50:22,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:22,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967674250] [2025-01-10 06:50:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967674250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:22,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005721690] [2025-01-10 06:50:22,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:22,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:22,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:22,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:22,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:22,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:50:22,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 122 transitions, 521 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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:50:22,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:22,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:50:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:23,167 INFO L124 PetriNetUnfolderBase]: 558/1256 cut-off events. [2025-01-10 06:50:23,168 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-01-10 06:50:23,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 1256 events. 558/1256 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7935 event pairs, 177 based on Foata normal form. 40/1051 useless extension candidates. Maximal degree in co-relation 2296. Up to 463 conditions per place. [2025-01-10 06:50:23,174 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 114 selfloop transitions, 5 changer transitions 0/149 dead transitions. [2025-01-10 06:50:23,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 149 transitions, 815 flow [2025-01-10 06:50:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-01-10 06:50:23,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6804123711340206 [2025-01-10 06:50:23,175 INFO L175 Difference]: Start difference. First operand has 103 places, 122 transitions, 521 flow. Second operand 4 states and 264 transitions. [2025-01-10 06:50:23,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 149 transitions, 815 flow [2025-01-10 06:50:23,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 149 transitions, 793 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:23,179 INFO L231 Difference]: Finished difference. Result has 106 places, 124 transitions, 533 flow [2025-01-10 06:50:23,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=533, PETRI_PLACES=106, PETRI_TRANSITIONS=124} [2025-01-10 06:50:23,180 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 15 predicate places. [2025-01-10 06:50:23,180 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 124 transitions, 533 flow [2025-01-10 06:50:23,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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:50:23,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:23,181 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:50:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:50:23,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:23,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash -746783500, now seen corresponding path program 1 times [2025-01-10 06:50:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122888152] [2025-01-10 06:50:23,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:23,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:50:23,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:50:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122888152] [2025-01-10 06:50:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122888152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977617190] [2025-01-10 06:50:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:23,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:23,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:23,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 124 transitions, 533 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:50:23,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:23,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:23,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:23,409 INFO L124 PetriNetUnfolderBase]: 368/998 cut-off events. [2025-01-10 06:50:23,410 INFO L125 PetriNetUnfolderBase]: For 285/309 co-relation queries the response was YES. [2025-01-10 06:50:23,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1921 conditions, 998 events. 368/998 cut-off events. For 285/309 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6506 event pairs, 228 based on Foata normal form. 14/832 useless extension candidates. Maximal degree in co-relation 1904. Up to 600 conditions per place. [2025-01-10 06:50:23,415 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 84 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-01-10 06:50:23,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 123 transitions, 703 flow [2025-01-10 06:50:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-01-10 06:50:23,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-01-10 06:50:23,416 INFO L175 Difference]: Start difference. First operand has 106 places, 124 transitions, 533 flow. Second operand 4 states and 239 transitions. [2025-01-10 06:50:23,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 123 transitions, 703 flow [2025-01-10 06:50:23,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 123 transitions, 703 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:23,420 INFO L231 Difference]: Finished difference. Result has 109 places, 123 transitions, 535 flow [2025-01-10 06:50:23,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=109, PETRI_TRANSITIONS=123} [2025-01-10 06:50:23,421 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 18 predicate places. [2025-01-10 06:50:23,421 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 123 transitions, 535 flow [2025-01-10 06:50:23,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:50:23,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:23,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:50:23,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:23,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1614803927, now seen corresponding path program 1 times [2025-01-10 06:50:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95402109] [2025-01-10 06:50:23,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:23,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:50:23,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:50:23,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:23,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95402109] [2025-01-10 06:50:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95402109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418979829] [2025-01-10 06:50:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:23,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:23,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:23,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:50:23,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 123 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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:50:23,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:23,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:50:23,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:23,671 INFO L124 PetriNetUnfolderBase]: 367/997 cut-off events. [2025-01-10 06:50:23,671 INFO L125 PetriNetUnfolderBase]: For 289/313 co-relation queries the response was YES. [2025-01-10 06:50:23,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 997 events. 367/997 cut-off events. For 289/313 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6438 event pairs, 228 based on Foata normal form. 14/831 useless extension candidates. Maximal degree in co-relation 1903. Up to 599 conditions per place. [2025-01-10 06:50:23,679 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 83 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-01-10 06:50:23,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 122 transitions, 703 flow [2025-01-10 06:50:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-01-10 06:50:23,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-01-10 06:50:23,680 INFO L175 Difference]: Start difference. First operand has 109 places, 123 transitions, 535 flow. Second operand 4 states and 239 transitions. [2025-01-10 06:50:23,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 122 transitions, 703 flow [2025-01-10 06:50:23,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 122 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:23,683 INFO L231 Difference]: Finished difference. Result has 110 places, 122 transitions, 533 flow [2025-01-10 06:50:23,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=533, PETRI_PLACES=110, PETRI_TRANSITIONS=122} [2025-01-10 06:50:23,684 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 19 predicate places. [2025-01-10 06:50:23,684 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 122 transitions, 533 flow [2025-01-10 06:50:23,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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:50:23,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:23,685 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:23,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:50:23,685 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1952906210, now seen corresponding path program 2 times [2025-01-10 06:50:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437479421] [2025-01-10 06:50:23,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:23,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:50:23,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 30 statements. [2025-01-10 06:50:23,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:23,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:50:23,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:23,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437479421] [2025-01-10 06:50:23,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437479421] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:23,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405448165] [2025-01-10 06:50:23,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:23,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:23,742 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:50:23,744 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:50:23,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:50:23,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 30 statements. [2025-01-10 06:50:23,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:50:23,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:23,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:50:23,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:50:23,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:50:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405448165] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:23,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-01-10 06:50:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945410676] [2025-01-10 06:50:23,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:23,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:23,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-01-10 06:50:23,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 122 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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:50:23,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:23,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-01-10 06:50:23,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:24,047 INFO L124 PetriNetUnfolderBase]: 367/995 cut-off events. [2025-01-10 06:50:24,047 INFO L125 PetriNetUnfolderBase]: For 299/323 co-relation queries the response was YES. [2025-01-10 06:50:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 995 events. 367/995 cut-off events. For 299/323 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6403 event pairs, 228 based on Foata normal form. 15/830 useless extension candidates. Maximal degree in co-relation 1894. Up to 579 conditions per place. [2025-01-10 06:50:24,052 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 55 selfloop transitions, 31 changer transitions 0/120 dead transitions. [2025-01-10 06:50:24,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 120 transitions, 685 flow [2025-01-10 06:50:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-01-10 06:50:24,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-01-10 06:50:24,054 INFO L175 Difference]: Start difference. First operand has 110 places, 122 transitions, 533 flow. Second operand 5 states and 267 transitions. [2025-01-10 06:50:24,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 120 transitions, 685 flow [2025-01-10 06:50:24,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 120 transitions, 661 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 06:50:24,057 INFO L231 Difference]: Finished difference. Result has 106 places, 120 transitions, 551 flow [2025-01-10 06:50:24,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=106, PETRI_TRANSITIONS=120} [2025-01-10 06:50:24,057 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 15 predicate places. [2025-01-10 06:50:24,057 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 120 transitions, 551 flow [2025-01-10 06:50:24,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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:50:24,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:24,058 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:50:24,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:24,258 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,SelfDestructingSolverStorable16 [2025-01-10 06:50:24,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:24,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash -438670043, now seen corresponding path program 1 times [2025-01-10 06:50:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356802287] [2025-01-10 06:50:24,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:24,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:50:24,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:50:24,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:24,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356802287] [2025-01-10 06:50:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356802287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329354283] [2025-01-10 06:50:24,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:24,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:24,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:24,746 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:50:24,748 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:50:24,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:50:24,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:50:24,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:24,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:24,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:50:24,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:24,891 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:50:24,991 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:50:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:25,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:25,086 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 18 treesize of output 16 [2025-01-10 06:50:25,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 22 treesize of output 16 [2025-01-10 06:50:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:25,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329354283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:25,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:25,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-10 06:50:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905474180] [2025-01-10 06:50:25,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:25,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 06:50:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:25,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 06:50:25,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-10 06:50:25,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-01-10 06:50:25,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 120 transitions, 551 flow. Second operand has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 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:50:25,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:25,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-01-10 06:50:25,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:26,065 INFO L124 PetriNetUnfolderBase]: 1364/3438 cut-off events. [2025-01-10 06:50:26,066 INFO L125 PetriNetUnfolderBase]: For 985/1007 co-relation queries the response was YES. [2025-01-10 06:50:26,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6716 conditions, 3438 events. 1364/3438 cut-off events. For 985/1007 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 28106 event pairs, 365 based on Foata normal form. 22/2951 useless extension candidates. Maximal degree in co-relation 6701. Up to 449 conditions per place. [2025-01-10 06:50:26,088 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 228 selfloop transitions, 37 changer transitions 0/297 dead transitions. [2025-01-10 06:50:26,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 297 transitions, 1822 flow [2025-01-10 06:50:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:50:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:50:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 812 transitions. [2025-01-10 06:50:26,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580756013745705 [2025-01-10 06:50:26,091 INFO L175 Difference]: Start difference. First operand has 106 places, 120 transitions, 551 flow. Second operand 15 states and 812 transitions. [2025-01-10 06:50:26,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 297 transitions, 1822 flow [2025-01-10 06:50:26,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 297 transitions, 1640 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:26,100 INFO L231 Difference]: Finished difference. Result has 119 places, 133 transitions, 665 flow [2025-01-10 06:50:26,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=665, PETRI_PLACES=119, PETRI_TRANSITIONS=133} [2025-01-10 06:50:26,100 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 28 predicate places. [2025-01-10 06:50:26,100 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 133 transitions, 665 flow [2025-01-10 06:50:26,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 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:50:26,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:26,101 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] [2025-01-10 06:50:26,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:26,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:26,302 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:26,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash -713900138, now seen corresponding path program 1 times [2025-01-10 06:50:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182953341] [2025-01-10 06:50:26,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:26,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:50:26,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:50:26,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:26,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:26,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182953341] [2025-01-10 06:50:26,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182953341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901719566] [2025-01-10 06:50:26,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:26,737 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:50:26,739 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:50:26,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:50:26,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:50:26,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:26,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:26,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 06:50:26,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:26,862 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:50:26,969 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:50:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:26,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:27,054 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 20 treesize of output 18 [2025-01-10 06:50:27,057 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 26 treesize of output 20 [2025-01-10 06:50:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901719566] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:27,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-10 06:50:27,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358978789] [2025-01-10 06:50:27,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 06:50:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 06:50:27,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-01-10 06:50:27,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2025-01-10 06:50:27,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 133 transitions, 665 flow. Second operand has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 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:50:27,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:27,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2025-01-10 06:50:27,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:27,987 INFO L124 PetriNetUnfolderBase]: 1630/3714 cut-off events. [2025-01-10 06:50:27,987 INFO L125 PetriNetUnfolderBase]: For 2038/2060 co-relation queries the response was YES. [2025-01-10 06:50:27,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7937 conditions, 3714 events. 1630/3714 cut-off events. For 2038/2060 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 28853 event pairs, 456 based on Foata normal form. 62/3272 useless extension candidates. Maximal degree in co-relation 7919. Up to 594 conditions per place. [2025-01-10 06:50:28,010 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 233 selfloop transitions, 37 changer transitions 0/299 dead transitions. [2025-01-10 06:50:28,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 299 transitions, 1777 flow [2025-01-10 06:50:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:50:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:50:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 781 transitions. [2025-01-10 06:50:28,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5367697594501718 [2025-01-10 06:50:28,014 INFO L175 Difference]: Start difference. First operand has 119 places, 133 transitions, 665 flow. Second operand 15 states and 781 transitions. [2025-01-10 06:50:28,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 299 transitions, 1777 flow [2025-01-10 06:50:28,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 299 transitions, 1770 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:28,023 INFO L231 Difference]: Finished difference. Result has 132 places, 136 transitions, 767 flow [2025-01-10 06:50:28,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=767, PETRI_PLACES=132, PETRI_TRANSITIONS=136} [2025-01-10 06:50:28,024 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 41 predicate places. [2025-01-10 06:50:28,024 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 136 transitions, 767 flow [2025-01-10 06:50:28,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 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:50:28,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:28,025 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] [2025-01-10 06:50:28,036 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:50:28,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:28,226 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1932212730, now seen corresponding path program 1 times [2025-01-10 06:50:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486729905] [2025-01-10 06:50:28,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:50:28,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:50:28,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:28,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:28,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:28,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486729905] [2025-01-10 06:50:28,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486729905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:28,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:28,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150932487] [2025-01-10 06:50:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:28,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:28,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:28,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:50:28,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 136 transitions, 767 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:50:28,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:28,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:50:28,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:28,700 INFO L124 PetriNetUnfolderBase]: 2210/5034 cut-off events. [2025-01-10 06:50:28,701 INFO L125 PetriNetUnfolderBase]: For 4354/4433 co-relation queries the response was YES. [2025-01-10 06:50:28,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11279 conditions, 5034 events. 2210/5034 cut-off events. For 4354/4433 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 41950 event pairs, 754 based on Foata normal form. 213/4473 useless extension candidates. Maximal degree in co-relation 11259. Up to 1871 conditions per place. [2025-01-10 06:50:28,724 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 149 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-01-10 06:50:28,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 187 transitions, 1383 flow [2025-01-10 06:50:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-01-10 06:50:28,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752577319587629 [2025-01-10 06:50:28,725 INFO L175 Difference]: Start difference. First operand has 132 places, 136 transitions, 767 flow. Second operand 4 states and 262 transitions. [2025-01-10 06:50:28,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 187 transitions, 1383 flow [2025-01-10 06:50:28,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 187 transitions, 1308 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-01-10 06:50:28,732 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 754 flow [2025-01-10 06:50:28,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=754, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2025-01-10 06:50:28,732 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 36 predicate places. [2025-01-10 06:50:28,732 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 754 flow [2025-01-10 06:50:28,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:50:28,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:28,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:28,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:50:28,733 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash -656067737, now seen corresponding path program 1 times [2025-01-10 06:50:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47741260] [2025-01-10 06:50:28,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:50:28,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:50:28,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:28,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:29,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47741260] [2025-01-10 06:50:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47741260] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559015279] [2025-01-10 06:50:29,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:29,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:29,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:29,208 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:50:29,209 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:50:29,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:50:29,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:50:29,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:29,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:29,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 06:50:29,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:29,340 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:50:29,357 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:50:29,464 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:29,465 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:50:29,473 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:50:29,558 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:50:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:29,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:29,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_338) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-01-10 06:50:29,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:29,777 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 28 treesize of output 29 [2025-01-10 06:50:29,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:29,784 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 47 treesize of output 39 [2025-01-10 06:50:29,788 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 15 treesize of output 9 [2025-01-10 06:50:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-01-10 06:50:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559015279] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:29,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-01-10 06:50:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740811443] [2025-01-10 06:50:29,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 06:50:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:29,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 06:50:29,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=318, Unknown=1, NotChecked=36, Total=420 [2025-01-10 06:50:29,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-01-10 06:50:29,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 754 flow. Second operand has 21 states, 21 states have (on average 32.80952380952381) internal successors, (689), 21 states have internal predecessors, (689), 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:50:29,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:29,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-01-10 06:50:29,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:30,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_120| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_120|) 0)) (forall ((v_ArrVal_338 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_120| v_ArrVal_338) c_~get_2~0.base) .cse0)))))) (<= 0 c_~id_0~0) (forall ((v_ArrVal_338 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_338) c_~get_2~0.base) .cse0)))))) is different from false [2025-01-10 06:50:32,777 INFO L124 PetriNetUnfolderBase]: 9111/17332 cut-off events. [2025-01-10 06:50:32,777 INFO L125 PetriNetUnfolderBase]: For 11337/12004 co-relation queries the response was YES. [2025-01-10 06:50:32,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42799 conditions, 17332 events. 9111/17332 cut-off events. For 11337/12004 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 151694 event pairs, 1928 based on Foata normal form. 505/16766 useless extension candidates. Maximal degree in co-relation 42779. Up to 2804 conditions per place. [2025-01-10 06:50:32,983 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 409 selfloop transitions, 90 changer transitions 0/518 dead transitions. [2025-01-10 06:50:32,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 518 transitions, 3429 flow [2025-01-10 06:50:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 06:50:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-10 06:50:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1201 transitions. [2025-01-10 06:50:32,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4269463206541059 [2025-01-10 06:50:32,990 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 754 flow. Second operand 29 states and 1201 transitions. [2025-01-10 06:50:32,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 518 transitions, 3429 flow [2025-01-10 06:50:33,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 518 transitions, 3429 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:33,041 INFO L231 Difference]: Finished difference. Result has 163 places, 198 transitions, 1508 flow [2025-01-10 06:50:33,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1508, PETRI_PLACES=163, PETRI_TRANSITIONS=198} [2025-01-10 06:50:33,042 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 72 predicate places. [2025-01-10 06:50:33,042 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 198 transitions, 1508 flow [2025-01-10 06:50:33,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 32.80952380952381) internal successors, (689), 21 states have internal predecessors, (689), 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:50:33,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:33,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:33,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:50:33,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:33,247 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:33,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash -230946413, now seen corresponding path program 1 times [2025-01-10 06:50:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:33,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070208028] [2025-01-10 06:50:33,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:33,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:50:33,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:50:33,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070208028] [2025-01-10 06:50:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070208028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802435209] [2025-01-10 06:50:33,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:33,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:33,677 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:50:33,680 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:50:33,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:50:33,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:50:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:33,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 06:50:33,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:33,781 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:50:33,798 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:50:33,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:33,880 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:50:33,891 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:50:33,973 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:50:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:33,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:34,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:34,141 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:50:34,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:34,147 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 41 treesize of output 33 [2025-01-10 06:50:34,152 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 7 [2025-01-10 06:50:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:34,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802435209] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:34,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:34,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 06:50:34,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458619529] [2025-01-10 06:50:34,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:34,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:50:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:34,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:50:34,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2025-01-10 06:50:34,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-01-10 06:50:34,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 198 transitions, 1508 flow. Second operand has 19 states, 19 states have (on average 35.10526315789474) internal successors, (667), 19 states have internal predecessors, (667), 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:50:34,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:34,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-01-10 06:50:34,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:35,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((v_ArrVal_374 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_374) c_~get_2~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_123| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_123|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_123| v_ArrVal_374) c_~get_2~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-01-10 06:50:37,646 INFO L124 PetriNetUnfolderBase]: 9913/18911 cut-off events. [2025-01-10 06:50:37,647 INFO L125 PetriNetUnfolderBase]: For 34786/35299 co-relation queries the response was YES. [2025-01-10 06:50:37,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53123 conditions, 18911 events. 9913/18911 cut-off events. For 34786/35299 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 167383 event pairs, 2220 based on Foata normal form. 170/17688 useless extension candidates. Maximal degree in co-relation 53093. Up to 3427 conditions per place. [2025-01-10 06:50:37,865 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 376 selfloop transitions, 61 changer transitions 0/467 dead transitions. [2025-01-10 06:50:37,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 467 transitions, 3903 flow [2025-01-10 06:50:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:50:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:50:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 936 transitions. [2025-01-10 06:50:37,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4386129334582943 [2025-01-10 06:50:37,868 INFO L175 Difference]: Start difference. First operand has 163 places, 198 transitions, 1508 flow. Second operand 22 states and 936 transitions. [2025-01-10 06:50:37,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 467 transitions, 3903 flow [2025-01-10 06:50:37,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 467 transitions, 3814 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-10 06:50:37,994 INFO L231 Difference]: Finished difference. Result has 180 places, 211 transitions, 1674 flow [2025-01-10 06:50:37,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1674, PETRI_PLACES=180, PETRI_TRANSITIONS=211} [2025-01-10 06:50:37,995 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 89 predicate places. [2025-01-10 06:50:37,995 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 211 transitions, 1674 flow [2025-01-10 06:50:37,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 35.10526315789474) internal successors, (667), 19 states have internal predecessors, (667), 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:50:37,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:37,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:38,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:38,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:38,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:38,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:38,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1136737721, now seen corresponding path program 1 times [2025-01-10 06:50:38,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:38,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679836701] [2025-01-10 06:50:38,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:50:38,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:50:38,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:38,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679836701] [2025-01-10 06:50:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679836701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096005942] [2025-01-10 06:50:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:38,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:38,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:38,744 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:50:38,746 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:50:38,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:50:38,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:50:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:38,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 06:50:38,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:38,861 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:50:38,886 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:50:38,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:38,965 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:50:38,990 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:50:39,057 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:50:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:39,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:39,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_409) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 2147483648)) is different from false [2025-01-10 06:50:39,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:39,358 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:50:39,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:39,366 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 41 treesize of output 33 [2025-01-10 06:50:39,370 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 7 [2025-01-10 06:50:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-01-10 06:50:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096005942] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:39,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-01-10 06:50:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704107159] [2025-01-10 06:50:39,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 06:50:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:39,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 06:50:39,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=563, Unknown=1, NotChecked=48, Total=702 [2025-01-10 06:50:39,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 97 [2025-01-10 06:50:39,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 211 transitions, 1674 flow. Second operand has 27 states, 27 states have (on average 27.185185185185187) internal successors, (734), 27 states have internal predecessors, (734), 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:50:39,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:39,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 97 [2025-01-10 06:50:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:41,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_0~0 4))) (let ((.cse1 (+ .cse0 c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_126| Int) (v_ArrVal_409 (Array Int Int))) (or (< (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_126| v_ArrVal_409) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_126|) 0)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_409 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_409) c_~get_2~0.base) .cse1) 2147483648)) (<= 0 c_~id_3~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_126| Int)) (or (forall ((v_ArrVal_409 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_126| v_ArrVal_409) c_~get_2~0.base) .cse1) 2147483648)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_126|) 0))))))) is different from false [2025-01-10 06:50:43,706 INFO L124 PetriNetUnfolderBase]: 10024/18705 cut-off events. [2025-01-10 06:50:43,706 INFO L125 PetriNetUnfolderBase]: For 25692/26725 co-relation queries the response was YES. [2025-01-10 06:50:43,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54452 conditions, 18705 events. 10024/18705 cut-off events. For 25692/26725 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 161839 event pairs, 2556 based on Foata normal form. 946/18553 useless extension candidates. Maximal degree in co-relation 54419. Up to 3886 conditions per place. [2025-01-10 06:50:43,813 INFO L140 encePairwiseOnDemand]: 77/97 looper letters, 420 selfloop transitions, 101 changer transitions 18/561 dead transitions. [2025-01-10 06:50:43,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 561 transitions, 4318 flow [2025-01-10 06:50:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-10 06:50:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-10 06:50:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1147 transitions. [2025-01-10 06:50:43,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3583255232739769 [2025-01-10 06:50:43,815 INFO L175 Difference]: Start difference. First operand has 180 places, 211 transitions, 1674 flow. Second operand 33 states and 1147 transitions. [2025-01-10 06:50:43,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 561 transitions, 4318 flow [2025-01-10 06:50:43,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 561 transitions, 4236 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-01-10 06:50:43,923 INFO L231 Difference]: Finished difference. Result has 205 places, 237 transitions, 2038 flow [2025-01-10 06:50:43,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2038, PETRI_PLACES=205, PETRI_TRANSITIONS=237} [2025-01-10 06:50:43,924 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 114 predicate places. [2025-01-10 06:50:43,924 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 237 transitions, 2038 flow [2025-01-10 06:50:43,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 27.185185185185187) internal successors, (734), 27 states have internal predecessors, (734), 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:50:43,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:43,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:43,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:44,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 06:50:44,129 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:44,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1430565118, now seen corresponding path program 1 times [2025-01-10 06:50:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646927979] [2025-01-10 06:50:44,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:44,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:50:44,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:50:44,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:44,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646927979] [2025-01-10 06:50:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646927979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325467743] [2025-01-10 06:50:44,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:44,504 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:50:44,506 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:50:44,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:50:44,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:50:44,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:44,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:44,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 06:50:44,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:44,611 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:50:44,635 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 23 treesize of output 1 [2025-01-10 06:50:44,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:50:44,750 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:50:44,781 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 22 treesize of output 17 [2025-01-10 06:50:44,927 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:50:44,927 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 25 treesize of output 12 [2025-01-10 06:50:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:44,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:45,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:45,070 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 28 treesize of output 29 [2025-01-10 06:50:45,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:50:45,075 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 47 treesize of output 39 [2025-01-10 06:50:45,078 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 15 treesize of output 9 [2025-01-10 06:50:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:45,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325467743] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:45,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 06:50:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796747878] [2025-01-10 06:50:45,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:50:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:45,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:50:45,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2025-01-10 06:50:45,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-01-10 06:50:45,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 237 transitions, 2038 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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:50:45,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:45,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-01-10 06:50:45,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:46,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129| Int)) (or (forall ((v_ArrVal_444 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129| v_ArrVal_444) c_~get_2~0.base) .cse0) 4294967296))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129|) 0)))) (forall ((v_ArrVal_444 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_444) c_~get_2~0.base) .cse0) 4294967296))))) is different from false [2025-01-10 06:50:49,335 INFO L124 PetriNetUnfolderBase]: 9922/18854 cut-off events. [2025-01-10 06:50:49,335 INFO L125 PetriNetUnfolderBase]: For 53992/55425 co-relation queries the response was YES. [2025-01-10 06:50:49,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60760 conditions, 18854 events. 9922/18854 cut-off events. For 53992/55425 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 166016 event pairs, 2712 based on Foata normal form. 620/18238 useless extension candidates. Maximal degree in co-relation 60720. Up to 3983 conditions per place. [2025-01-10 06:50:49,536 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 381 selfloop transitions, 61 changer transitions 0/484 dead transitions. [2025-01-10 06:50:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 484 transitions, 4542 flow [2025-01-10 06:50:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:50:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:50:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 921 transitions. [2025-01-10 06:50:49,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43158388003748827 [2025-01-10 06:50:49,538 INFO L175 Difference]: Start difference. First operand has 205 places, 237 transitions, 2038 flow. Second operand 22 states and 921 transitions. [2025-01-10 06:50:49,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 484 transitions, 4542 flow [2025-01-10 06:50:49,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 484 transitions, 4390 flow, removed 12 selfloop flow, removed 14 redundant places. [2025-01-10 06:50:49,770 INFO L231 Difference]: Finished difference. Result has 213 places, 240 transitions, 2089 flow [2025-01-10 06:50:49,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2089, PETRI_PLACES=213, PETRI_TRANSITIONS=240} [2025-01-10 06:50:49,771 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 122 predicate places. [2025-01-10 06:50:49,771 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 240 transitions, 2089 flow [2025-01-10 06:50:49,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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:50:49,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:49,771 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] [2025-01-10 06:50:49,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:49,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:49,974 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1826449165, now seen corresponding path program 1 times [2025-01-10 06:50:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752813094] [2025-01-10 06:50:49,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:49,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:50:49,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:50:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:50:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752813094] [2025-01-10 06:50:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752813094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:50:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437481554] [2025-01-10 06:50:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:50,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:50,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:50,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:50,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-01-10 06:50:50,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 240 transitions, 2089 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:50:50,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:50,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-01-10 06:50:50,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:51,407 INFO L124 PetriNetUnfolderBase]: 7351/15206 cut-off events. [2025-01-10 06:50:51,407 INFO L125 PetriNetUnfolderBase]: For 33828/34142 co-relation queries the response was YES. [2025-01-10 06:50:51,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48079 conditions, 15206 events. 7351/15206 cut-off events. For 33828/34142 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 139382 event pairs, 2793 based on Foata normal form. 388/14866 useless extension candidates. Maximal degree in co-relation 48037. Up to 6535 conditions per place. [2025-01-10 06:50:51,524 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 255 selfloop transitions, 38 changer transitions 10/337 dead transitions. [2025-01-10 06:50:51,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 337 transitions, 3261 flow [2025-01-10 06:50:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 371 transitions. [2025-01-10 06:50:51,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6374570446735395 [2025-01-10 06:50:51,525 INFO L175 Difference]: Start difference. First operand has 213 places, 240 transitions, 2089 flow. Second operand 6 states and 371 transitions. [2025-01-10 06:50:51,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 337 transitions, 3261 flow [2025-01-10 06:50:51,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 337 transitions, 3042 flow, removed 12 selfloop flow, removed 19 redundant places. [2025-01-10 06:50:51,761 INFO L231 Difference]: Finished difference. Result has 201 places, 237 transitions, 2002 flow [2025-01-10 06:50:51,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2002, PETRI_PLACES=201, PETRI_TRANSITIONS=237} [2025-01-10 06:50:51,761 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 110 predicate places. [2025-01-10 06:50:51,761 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 237 transitions, 2002 flow [2025-01-10 06:50:51,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:50:51,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:51,762 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] [2025-01-10 06:50:51,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:50:51,762 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:51,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1397845781, now seen corresponding path program 1 times [2025-01-10 06:50:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:51,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835560675] [2025-01-10 06:50:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:51,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:50:51,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:50:51,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:51,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:52,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835560675] [2025-01-10 06:50:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835560675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426394093] [2025-01-10 06:50:52,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:52,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:52,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:52,043 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:50:52,044 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:50:52,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:50:52,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:50:52,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:52,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:52,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:50:52,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:52,174 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:50:52,277 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:50:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:52,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:52,397 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 20 treesize of output 18 [2025-01-10 06:50:52,402 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 26 treesize of output 20 [2025-01-10 06:50:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426394093] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:52,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 06:50:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592359803] [2025-01-10 06:50:52,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:52,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:50:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:52,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:50:52,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:50:52,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 97 [2025-01-10 06:50:52,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 237 transitions, 2002 flow. Second operand has 19 states, 19 states have (on average 39.36842105263158) internal successors, (748), 19 states have internal predecessors, (748), 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:50:52,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:52,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 97 [2025-01-10 06:50:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:54,436 INFO L124 PetriNetUnfolderBase]: 8635/16573 cut-off events. [2025-01-10 06:50:54,436 INFO L125 PetriNetUnfolderBase]: For 56524/57420 co-relation queries the response was YES. [2025-01-10 06:50:54,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54465 conditions, 16573 events. 8635/16573 cut-off events. For 56524/57420 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 144179 event pairs, 2118 based on Foata normal form. 424/16297 useless extension candidates. Maximal degree in co-relation 54425. Up to 2873 conditions per place. [2025-01-10 06:50:54,559 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 743 selfloop transitions, 78 changer transitions 10/872 dead transitions. [2025-01-10 06:50:54,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 872 transitions, 8438 flow [2025-01-10 06:50:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:50:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:50:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1076 transitions. [2025-01-10 06:50:54,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5042174320524836 [2025-01-10 06:50:54,562 INFO L175 Difference]: Start difference. First operand has 201 places, 237 transitions, 2002 flow. Second operand 22 states and 1076 transitions. [2025-01-10 06:50:54,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 872 transitions, 8438 flow [2025-01-10 06:50:54,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 872 transitions, 8236 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:54,688 INFO L231 Difference]: Finished difference. Result has 226 places, 261 transitions, 2365 flow [2025-01-10 06:50:54,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2365, PETRI_PLACES=226, PETRI_TRANSITIONS=261} [2025-01-10 06:50:54,689 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 135 predicate places. [2025-01-10 06:50:54,689 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 261 transitions, 2365 flow [2025-01-10 06:50:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 39.36842105263158) internal successors, (748), 19 states have internal predecessors, (748), 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:50:54,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:54,689 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] [2025-01-10 06:50:54,695 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:50:54,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:54,890 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 383547361, now seen corresponding path program 1 times [2025-01-10 06:50:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800347090] [2025-01-10 06:50:54,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:54,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:50:54,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:50:54,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800347090] [2025-01-10 06:50:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800347090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950119813] [2025-01-10 06:50:55,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:55,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:55,160 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:50:55,162 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:50:55,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:50:55,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:50:55,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:55,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:55,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:50:55,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:55,285 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 23 treesize of output 1 [2025-01-10 06:50:55,475 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:50:55,475 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 23 treesize of output 10 [2025-01-10 06:50:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:55,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:55,586 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 18 treesize of output 16 [2025-01-10 06:50:55,588 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 16 [2025-01-10 06:50:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:50:55,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950119813] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:55,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:55,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 06:50:55,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765240704] [2025-01-10 06:50:55,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:55,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 06:50:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:55,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 06:50:55,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-01-10 06:50:55,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-01-10 06:50:55,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 261 transitions, 2365 flow. Second operand has 20 states, 20 states have (on average 40.2) internal successors, (804), 20 states have internal predecessors, (804), 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:50:55,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:55,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-01-10 06:50:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:57,876 INFO L124 PetriNetUnfolderBase]: 7619/15319 cut-off events. [2025-01-10 06:50:57,877 INFO L125 PetriNetUnfolderBase]: For 52250/53040 co-relation queries the response was YES. [2025-01-10 06:50:57,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53150 conditions, 15319 events. 7619/15319 cut-off events. For 52250/53040 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 137495 event pairs, 2327 based on Foata normal form. 771/15503 useless extension candidates. Maximal degree in co-relation 53102. Up to 3263 conditions per place. [2025-01-10 06:50:58,035 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 646 selfloop transitions, 83 changer transitions 160/935 dead transitions. [2025-01-10 06:50:58,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 935 transitions, 9144 flow [2025-01-10 06:50:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 06:50:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 06:50:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1180 transitions. [2025-01-10 06:50:58,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506872852233677 [2025-01-10 06:50:58,037 INFO L175 Difference]: Start difference. First operand has 226 places, 261 transitions, 2365 flow. Second operand 24 states and 1180 transitions. [2025-01-10 06:50:58,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 935 transitions, 9144 flow [2025-01-10 06:50:58,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 935 transitions, 9067 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 06:50:58,186 INFO L231 Difference]: Finished difference. Result has 250 places, 281 transitions, 2656 flow [2025-01-10 06:50:58,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2656, PETRI_PLACES=250, PETRI_TRANSITIONS=281} [2025-01-10 06:50:58,187 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 159 predicate places. [2025-01-10 06:50:58,187 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 281 transitions, 2656 flow [2025-01-10 06:50:58,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 40.2) internal successors, (804), 20 states have internal predecessors, (804), 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:50:58,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:58,187 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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:50:58,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 06:50:58,387 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,SelfDestructingSolverStorable26 [2025-01-10 06:50:58,388 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:50:58,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1663286053, now seen corresponding path program 2 times [2025-01-10 06:50:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004549637] [2025-01-10 06:50:58,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:58,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 06:50:58,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:50:58,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:50:58,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004549637] [2025-01-10 06:50:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004549637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:50:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400254482] [2025-01-10 06:50:58,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:50:58,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:50:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:58,529 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:50:58,532 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:50:58,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 06:50:58,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:50:58,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:50:58,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:58,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 06:50:58,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:50:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:58,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:50:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:50:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400254482] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:50:58,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:50:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-10 06:50:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102767788] [2025-01-10 06:50:58,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:50:58,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 06:50:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:58,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 06:50:58,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-01-10 06:50:59,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-01-10 06:50:59,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 281 transitions, 2656 flow. Second operand has 27 states, 27 states have (on average 42.851851851851855) internal successors, (1157), 27 states have internal predecessors, (1157), 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:50:59,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:59,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-01-10 06:50:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:00,515 INFO L124 PetriNetUnfolderBase]: 4610/11601 cut-off events. [2025-01-10 06:51:00,515 INFO L125 PetriNetUnfolderBase]: For 41516/41926 co-relation queries the response was YES. [2025-01-10 06:51:00,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42100 conditions, 11601 events. 4610/11601 cut-off events. For 41516/41926 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 112413 event pairs, 3482 based on Foata normal form. 166/11439 useless extension candidates. Maximal degree in co-relation 42044. Up to 2736 conditions per place. [2025-01-10 06:51:00,585 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 222 selfloop transitions, 101 changer transitions 0/393 dead transitions. [2025-01-10 06:51:00,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 393 transitions, 3919 flow [2025-01-10 06:51:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:51:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:51:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 940 transitions. [2025-01-10 06:51:00,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4845360824742268 [2025-01-10 06:51:00,587 INFO L175 Difference]: Start difference. First operand has 250 places, 281 transitions, 2656 flow. Second operand 20 states and 940 transitions. [2025-01-10 06:51:00,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 393 transitions, 3919 flow [2025-01-10 06:51:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 393 transitions, 3836 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-01-10 06:51:00,808 INFO L231 Difference]: Finished difference. Result has 264 places, 323 transitions, 3065 flow [2025-01-10 06:51:00,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2573, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3065, PETRI_PLACES=264, PETRI_TRANSITIONS=323} [2025-01-10 06:51:00,809 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 173 predicate places. [2025-01-10 06:51:00,809 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 323 transitions, 3065 flow [2025-01-10 06:51:00,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 42.851851851851855) internal successors, (1157), 27 states have internal predecessors, (1157), 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:51:00,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:00,809 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] [2025-01-10 06:51:00,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 06:51:01,010 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,SelfDestructingSolverStorable27 [2025-01-10 06:51:01,010 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -47615493, now seen corresponding path program 1 times [2025-01-10 06:51:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409383438] [2025-01-10 06:51:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:01,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:51:01,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:51:01,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:01,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:51:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409383438] [2025-01-10 06:51:01,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409383438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:01,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:01,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703941616] [2025-01-10 06:51:01,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:01,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:01,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:01,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:01,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:51:01,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 323 transitions, 3065 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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:51:01,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:01,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:51:01,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:02,262 INFO L124 PetriNetUnfolderBase]: 6314/13493 cut-off events. [2025-01-10 06:51:02,262 INFO L125 PetriNetUnfolderBase]: For 50167/50845 co-relation queries the response was YES. [2025-01-10 06:51:02,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49206 conditions, 13493 events. 6314/13493 cut-off events. For 50167/50845 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 118996 event pairs, 2607 based on Foata normal form. 492/13758 useless extension candidates. Maximal degree in co-relation 49147. Up to 5900 conditions per place. [2025-01-10 06:51:02,497 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 314 selfloop transitions, 16 changer transitions 74/453 dead transitions. [2025-01-10 06:51:02,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 453 transitions, 5037 flow [2025-01-10 06:51:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-01-10 06:51:02,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623711340206185 [2025-01-10 06:51:02,498 INFO L175 Difference]: Start difference. First operand has 264 places, 323 transitions, 3065 flow. Second operand 4 states and 257 transitions. [2025-01-10 06:51:02,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 453 transitions, 5037 flow [2025-01-10 06:51:02,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 453 transitions, 4894 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-01-10 06:51:02,681 INFO L231 Difference]: Finished difference. Result has 255 places, 281 transitions, 2556 flow [2025-01-10 06:51:02,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2556, PETRI_PLACES=255, PETRI_TRANSITIONS=281} [2025-01-10 06:51:02,682 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 164 predicate places. [2025-01-10 06:51:02,682 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 281 transitions, 2556 flow [2025-01-10 06:51:02,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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:51:02,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:02,682 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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:51:02,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:51:02,682 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:02,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash -432681272, now seen corresponding path program 1 times [2025-01-10 06:51:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:02,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676337318] [2025-01-10 06:51:02,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:02,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:51:02,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:51:02,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:02,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:51:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676337318] [2025-01-10 06:51:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676337318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960745454] [2025-01-10 06:51:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:02,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:02,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:51:02,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 281 transitions, 2556 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:51:02,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:02,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:51:02,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:03,484 INFO L124 PetriNetUnfolderBase]: 3693/8359 cut-off events. [2025-01-10 06:51:03,484 INFO L125 PetriNetUnfolderBase]: For 30173/30731 co-relation queries the response was YES. [2025-01-10 06:51:03,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31585 conditions, 8359 events. 3693/8359 cut-off events. For 30173/30731 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 71289 event pairs, 1274 based on Foata normal form. 246/8560 useless extension candidates. Maximal degree in co-relation 31526. Up to 3209 conditions per place. [2025-01-10 06:51:03,553 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 304 selfloop transitions, 22 changer transitions 0/372 dead transitions. [2025-01-10 06:51:03,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 372 transitions, 3976 flow [2025-01-10 06:51:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-01-10 06:51:03,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6701030927835051 [2025-01-10 06:51:03,553 INFO L175 Difference]: Start difference. First operand has 255 places, 281 transitions, 2556 flow. Second operand 4 states and 260 transitions. [2025-01-10 06:51:03,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 372 transitions, 3976 flow [2025-01-10 06:51:03,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 372 transitions, 3874 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:03,675 INFO L231 Difference]: Finished difference. Result has 251 places, 278 transitions, 2522 flow [2025-01-10 06:51:03,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2522, PETRI_PLACES=251, PETRI_TRANSITIONS=278} [2025-01-10 06:51:03,676 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 160 predicate places. [2025-01-10 06:51:03,676 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 278 transitions, 2522 flow [2025-01-10 06:51:03,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:51:03,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:03,676 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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:51:03,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:51:03,676 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:03,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -432682297, now seen corresponding path program 2 times [2025-01-10 06:51:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:03,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389340297] [2025-01-10 06:51:03,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:03,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-10 06:51:03,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:51:03,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:03,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389340297] [2025-01-10 06:51:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389340297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848859429] [2025-01-10 06:51:03,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:03,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:03,773 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:51:03,774 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:51:03,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-10 06:51:03,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:51:03,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:03,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:03,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 06:51:03,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:51:03,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:51:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848859429] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:04,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:04,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2025-01-10 06:51:04,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226188808] [2025-01-10 06:51:04,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:51:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:04,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:51:04,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:51:04,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-01-10 06:51:04,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 278 transitions, 2522 flow. Second operand has 23 states, 23 states have (on average 43.04347826086956) internal successors, (990), 23 states have internal predecessors, (990), 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:51:04,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:04,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-01-10 06:51:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:05,254 INFO L124 PetriNetUnfolderBase]: 2988/7423 cut-off events. [2025-01-10 06:51:05,254 INFO L125 PetriNetUnfolderBase]: For 27135/27561 co-relation queries the response was YES. [2025-01-10 06:51:05,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27631 conditions, 7423 events. 2988/7423 cut-off events. For 27135/27561 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 65162 event pairs, 2174 based on Foata normal form. 165/7512 useless extension candidates. Maximal degree in co-relation 27574. Up to 2744 conditions per place. [2025-01-10 06:51:05,309 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 196 selfloop transitions, 113 changer transitions 46/410 dead transitions. [2025-01-10 06:51:05,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 410 transitions, 4144 flow [2025-01-10 06:51:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:51:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:51:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 948 transitions. [2025-01-10 06:51:05,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.488659793814433 [2025-01-10 06:51:05,311 INFO L175 Difference]: Start difference. First operand has 251 places, 278 transitions, 2522 flow. Second operand 20 states and 948 transitions. [2025-01-10 06:51:05,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 410 transitions, 4144 flow [2025-01-10 06:51:05,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 410 transitions, 4100 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:05,411 INFO L231 Difference]: Finished difference. Result has 271 places, 320 transitions, 3169 flow [2025-01-10 06:51:05,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3169, PETRI_PLACES=271, PETRI_TRANSITIONS=320} [2025-01-10 06:51:05,412 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 180 predicate places. [2025-01-10 06:51:05,412 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 320 transitions, 3169 flow [2025-01-10 06:51:05,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.04347826086956) internal successors, (990), 23 states have internal predecessors, (990), 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:51:05,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:05,412 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:05,419 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:51:05,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:05,613 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1677894171, now seen corresponding path program 3 times [2025-01-10 06:51:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:05,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818847332] [2025-01-10 06:51:05,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:51:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:05,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-01-10 06:51:05,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-01-10 06:51:05,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:51:05,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:51:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818847332] [2025-01-10 06:51:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818847332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384881314] [2025-01-10 06:51:05,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:51:05,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:05,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:05,805 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:51:05,807 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:51:05,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-01-10 06:51:05,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-01-10 06:51:05,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:51:05,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:05,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 06:51:05,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:05,922 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 23 treesize of output 1 [2025-01-10 06:51:05,998 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 23 treesize of output 7 [2025-01-10 06:51:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:51:06,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384881314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:06,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-01-10 06:51:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224349859] [2025-01-10 06:51:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:06,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:51:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:06,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:51:06,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:51:06,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 97 [2025-01-10 06:51:06,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 320 transitions, 3169 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 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:51:06,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:06,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 97 [2025-01-10 06:51:06,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:06,852 INFO L124 PetriNetUnfolderBase]: 3041/7258 cut-off events. [2025-01-10 06:51:06,852 INFO L125 PetriNetUnfolderBase]: For 25157/25631 co-relation queries the response was YES. [2025-01-10 06:51:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26998 conditions, 7258 events. 3041/7258 cut-off events. For 25157/25631 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 62379 event pairs, 650 based on Foata normal form. 235/7485 useless extension candidates. Maximal degree in co-relation 26938. Up to 2924 conditions per place. [2025-01-10 06:51:06,915 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 254 selfloop transitions, 59 changer transitions 0/364 dead transitions. [2025-01-10 06:51:06,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 364 transitions, 4144 flow [2025-01-10 06:51:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 405 transitions. [2025-01-10 06:51:06,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964653902798233 [2025-01-10 06:51:06,916 INFO L175 Difference]: Start difference. First operand has 271 places, 320 transitions, 3169 flow. Second operand 7 states and 405 transitions. [2025-01-10 06:51:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 364 transitions, 4144 flow [2025-01-10 06:51:07,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 364 transitions, 4026 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-01-10 06:51:07,015 INFO L231 Difference]: Finished difference. Result has 265 places, 317 transitions, 3146 flow [2025-01-10 06:51:07,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3146, PETRI_PLACES=265, PETRI_TRANSITIONS=317} [2025-01-10 06:51:07,016 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 174 predicate places. [2025-01-10 06:51:07,016 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 317 transitions, 3146 flow [2025-01-10 06:51:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 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:51:07,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:07,017 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:07,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:07,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:07,218 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -475142442, now seen corresponding path program 2 times [2025-01-10 06:51:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101732844] [2025-01-10 06:51:07,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:07,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:51:07,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:51:07,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:07,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:51:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:07,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101732844] [2025-01-10 06:51:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101732844] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368583296] [2025-01-10 06:51:07,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:07,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:07,484 INFO L229 MonitoredProcess]: Starting monitored process 19 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:51:07,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 06:51:07,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:51:07,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:51:07,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:07,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 06:51:07,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:07,629 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 23 treesize of output 1 [2025-01-10 06:51:07,717 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 25 treesize of output 9 [2025-01-10 06:51:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:51:07,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368583296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-01-10 06:51:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367766078] [2025-01-10 06:51:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:51:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:07,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:51:07,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:51:07,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-01-10 06:51:07,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 317 transitions, 3146 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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:51:07,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:07,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-01-10 06:51:07,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:08,563 INFO L124 PetriNetUnfolderBase]: 2915/7054 cut-off events. [2025-01-10 06:51:08,563 INFO L125 PetriNetUnfolderBase]: For 26539/26961 co-relation queries the response was YES. [2025-01-10 06:51:08,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26723 conditions, 7054 events. 2915/7054 cut-off events. For 26539/26961 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 60721 event pairs, 650 based on Foata normal form. 217/7263 useless extension candidates. Maximal degree in co-relation 26662. Up to 2720 conditions per place. [2025-01-10 06:51:08,612 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 241 selfloop transitions, 59 changer transitions 12/363 dead transitions. [2025-01-10 06:51:08,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 363 transitions, 4137 flow [2025-01-10 06:51:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 397 transitions. [2025-01-10 06:51:08,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846833578792342 [2025-01-10 06:51:08,614 INFO L175 Difference]: Start difference. First operand has 265 places, 317 transitions, 3146 flow. Second operand 7 states and 397 transitions. [2025-01-10 06:51:08,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 363 transitions, 4137 flow [2025-01-10 06:51:08,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 363 transitions, 4015 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:51:08,719 INFO L231 Difference]: Finished difference. Result has 263 places, 310 transitions, 3069 flow [2025-01-10 06:51:08,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3019, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3069, PETRI_PLACES=263, PETRI_TRANSITIONS=310} [2025-01-10 06:51:08,719 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 172 predicate places. [2025-01-10 06:51:08,720 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 310 transitions, 3069 flow [2025-01-10 06:51:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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:51:08,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:08,720 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:08,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 06:51:08,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:08,920 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:08,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash 17241063, now seen corresponding path program 3 times [2025-01-10 06:51:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:08,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672294640] [2025-01-10 06:51:08,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:51:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:08,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-01-10 06:51:08,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-01-10 06:51:08,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 06:51:08,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672294640] [2025-01-10 06:51:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672294640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737072652] [2025-01-10 06:51:09,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:51:09,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:09,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:09,416 INFO L229 MonitoredProcess]: Starting monitored process 20 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:51:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 06:51:09,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-01-10 06:51:09,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-01-10 06:51:09,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 06:51:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 06:51:09,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:09,569 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:51:09,592 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 23 treesize of output 1 [2025-01-10 06:51:09,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:51:09,666 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:51:09,671 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 22 treesize of output 17 [2025-01-10 06:51:09,706 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 25 treesize of output 9 [2025-01-10 06:51:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:09,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:09,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_794) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-01-10 06:51:09,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:09,912 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:51:09,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:09,922 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 48 treesize of output 41 [2025-01-10 06:51:09,926 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 15 treesize of output 9 [2025-01-10 06:51:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2025-01-10 06:51:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737072652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:09,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2025-01-10 06:51:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835952180] [2025-01-10 06:51:09,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:09,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 06:51:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:09,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 06:51:09,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2025-01-10 06:51:10,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 97 [2025-01-10 06:51:10,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 310 transitions, 3069 flow. Second operand has 21 states, 21 states have (on average 30.61904761904762) internal successors, (643), 21 states have internal predecessors, (643), 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:51:10,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 97 [2025-01-10 06:51:10,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,424 INFO L124 PetriNetUnfolderBase]: 4971/8980 cut-off events. [2025-01-10 06:51:11,424 INFO L125 PetriNetUnfolderBase]: For 29056/29900 co-relation queries the response was YES. [2025-01-10 06:51:11,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33780 conditions, 8980 events. 4971/8980 cut-off events. For 29056/29900 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 65214 event pairs, 650 based on Foata normal form. 487/9440 useless extension candidates. Maximal degree in co-relation 33719. Up to 2828 conditions per place. [2025-01-10 06:51:11,483 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 472 selfloop transitions, 99 changer transitions 0/597 dead transitions. [2025-01-10 06:51:11,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 597 transitions, 6333 flow [2025-01-10 06:51:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:51:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:51:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 565 transitions. [2025-01-10 06:51:11,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38831615120274915 [2025-01-10 06:51:11,486 INFO L175 Difference]: Start difference. First operand has 263 places, 310 transitions, 3069 flow. Second operand 15 states and 565 transitions. [2025-01-10 06:51:11,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 597 transitions, 6333 flow [2025-01-10 06:51:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 597 transitions, 6142 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-01-10 06:51:11,583 INFO L231 Difference]: Finished difference. Result has 263 places, 308 transitions, 3096 flow [2025-01-10 06:51:11,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3096, PETRI_PLACES=263, PETRI_TRANSITIONS=308} [2025-01-10 06:51:11,583 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 172 predicate places. [2025-01-10 06:51:11,583 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 308 transitions, 3096 flow [2025-01-10 06:51:11,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 30.61904761904762) internal successors, (643), 21 states have internal predecessors, (643), 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:51:11,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,584 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:11,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:11,784 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:11,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 442362387, now seen corresponding path program 2 times [2025-01-10 06:51:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259069870] [2025-01-10 06:51:11,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:51:11,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:51:11,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:11,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259069870] [2025-01-10 06:51:12,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259069870] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:12,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351546714] [2025-01-10 06:51:12,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:12,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:12,317 INFO L229 MonitoredProcess]: Starting monitored process 21 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:51:12,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 06:51:12,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:51:12,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:51:12,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:12,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 06:51:12,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:12,440 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:51:12,518 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 23 treesize of output 1 [2025-01-10 06:51:12,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:51:12,584 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:51:12,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 20 treesize of output 15 [2025-01-10 06:51:13,029 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:51:13,030 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 23 treesize of output 10 [2025-01-10 06:51:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:13,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:13,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:13,436 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:51:13,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:13,444 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 41 treesize of output 33 [2025-01-10 06:51:13,448 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 7 [2025-01-10 06:51:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351546714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:13,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 43 [2025-01-10 06:51:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739061143] [2025-01-10 06:51:13,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 06:51:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 06:51:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1684, Unknown=1, NotChecked=0, Total=1892 [2025-01-10 06:51:14,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-01-10 06:51:14,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 308 transitions, 3096 flow. Second operand has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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:51:14,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-01-10 06:51:14,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:17,789 INFO L124 PetriNetUnfolderBase]: 7312/13868 cut-off events. [2025-01-10 06:51:17,789 INFO L125 PetriNetUnfolderBase]: For 59793/60884 co-relation queries the response was YES. [2025-01-10 06:51:17,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53265 conditions, 13868 events. 7312/13868 cut-off events. For 59793/60884 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 111282 event pairs, 1104 based on Foata normal form. 361/14208 useless extension candidates. Maximal degree in co-relation 53209. Up to 3234 conditions per place. [2025-01-10 06:51:17,874 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 395 selfloop transitions, 105 changer transitions 4/535 dead transitions. [2025-01-10 06:51:17,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 535 transitions, 5911 flow [2025-01-10 06:51:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 06:51:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 06:51:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 862 transitions. [2025-01-10 06:51:17,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34179222839016654 [2025-01-10 06:51:17,876 INFO L175 Difference]: Start difference. First operand has 263 places, 308 transitions, 3096 flow. Second operand 26 states and 862 transitions. [2025-01-10 06:51:17,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 535 transitions, 5911 flow [2025-01-10 06:51:18,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 535 transitions, 5461 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-01-10 06:51:18,051 INFO L231 Difference]: Finished difference. Result has 270 places, 320 transitions, 3200 flow [2025-01-10 06:51:18,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3200, PETRI_PLACES=270, PETRI_TRANSITIONS=320} [2025-01-10 06:51:18,052 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 179 predicate places. [2025-01-10 06:51:18,052 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 320 transitions, 3200 flow [2025-01-10 06:51:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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:51:18,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:18,052 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:18,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 06:51:18,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:18,253 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:18,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 534474041, now seen corresponding path program 2 times [2025-01-10 06:51:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178935362] [2025-01-10 06:51:18,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:18,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:18,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 06:51:18,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 06:51:18,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:18,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178935362] [2025-01-10 06:51:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178935362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857861171] [2025-01-10 06:51:18,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:18,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:18,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:18,812 INFO L229 MonitoredProcess]: Starting monitored process 22 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:51:18,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 06:51:18,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 06:51:18,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 06:51:18,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:18,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:18,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:51:18,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:18,987 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:51:19,009 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 23 treesize of output 1 [2025-01-10 06:51:19,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:51:19,079 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:51:19,084 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:51:19,111 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 23 treesize of output 7 [2025-01-10 06:51:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:19,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:19,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:19,300 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:51:19,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:19,308 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 42 treesize of output 35 [2025-01-10 06:51:19,311 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 7 [2025-01-10 06:51:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857861171] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:19,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:19,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-01-10 06:51:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285632973] [2025-01-10 06:51:19,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:19,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 06:51:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 06:51:19,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=318, Unknown=4, NotChecked=0, Total=380 [2025-01-10 06:51:19,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-01-10 06:51:19,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 320 transitions, 3200 flow. Second operand has 20 states, 20 states have (on average 32.55) internal successors, (651), 20 states have internal predecessors, (651), 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:51:19,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:19,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-01-10 06:51:19,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:21,376 INFO L124 PetriNetUnfolderBase]: 7058/13056 cut-off events. [2025-01-10 06:51:21,376 INFO L125 PetriNetUnfolderBase]: For 38837/39903 co-relation queries the response was YES. [2025-01-10 06:51:21,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47105 conditions, 13056 events. 7058/13056 cut-off events. For 38837/39903 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 102648 event pairs, 1040 based on Foata normal form. 691/13580 useless extension candidates. Maximal degree in co-relation 47049. Up to 2949 conditions per place. [2025-01-10 06:51:21,471 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 299 selfloop transitions, 102 changer transitions 210/639 dead transitions. [2025-01-10 06:51:21,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 639 transitions, 7245 flow [2025-01-10 06:51:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:51:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:51:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 546 transitions. [2025-01-10 06:51:21,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4020618556701031 [2025-01-10 06:51:21,472 INFO L175 Difference]: Start difference. First operand has 270 places, 320 transitions, 3200 flow. Second operand 14 states and 546 transitions. [2025-01-10 06:51:21,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 639 transitions, 7245 flow [2025-01-10 06:51:21,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 639 transitions, 7025 flow, removed 58 selfloop flow, removed 19 redundant places. [2025-01-10 06:51:21,574 INFO L231 Difference]: Finished difference. Result has 263 places, 289 transitions, 2936 flow [2025-01-10 06:51:21,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2936, PETRI_PLACES=263, PETRI_TRANSITIONS=289} [2025-01-10 06:51:21,579 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 172 predicate places. [2025-01-10 06:51:21,579 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 289 transitions, 2936 flow [2025-01-10 06:51:21,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 32.55) internal successors, (651), 20 states have internal predecessors, (651), 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:51:21,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:21,579 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:21,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-10 06:51:21,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-10 06:51:21,780 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:21,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:21,781 INFO L85 PathProgramCache]: Analyzing trace with hash 828301438, now seen corresponding path program 2 times [2025-01-10 06:51:21,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:21,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568559816] [2025-01-10 06:51:21,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:21,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 06:51:21,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 06:51:21,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:51:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:22,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568559816] [2025-01-10 06:51:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568559816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817471245] [2025-01-10 06:51:22,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:22,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:22,192 INFO L229 MonitoredProcess]: Starting monitored process 23 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:51:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 06:51:22,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 06:51:22,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 06:51:22,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:22,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:22,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 06:51:22,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:22,341 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:51:22,421 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 23 treesize of output 1 [2025-01-10 06:51:22,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:51:22,486 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:51:22,511 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 22 treesize of output 17 [2025-01-10 06:51:22,888 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 06:51:22,889 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 25 treesize of output 12 [2025-01-10 06:51:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:22,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:23,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:23,226 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 28 treesize of output 29 [2025-01-10 06:51:23,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:51:23,236 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 47 treesize of output 39 [2025-01-10 06:51:23,239 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 15 treesize of output 9 [2025-01-10 06:51:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:23,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817471245] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:23,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:23,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 43 [2025-01-10 06:51:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139956007] [2025-01-10 06:51:23,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:23,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 06:51:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:23,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 06:51:23,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1684, Unknown=1, NotChecked=0, Total=1892 [2025-01-10 06:51:24,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-01-10 06:51:24,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 289 transitions, 2936 flow. Second operand has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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:51:24,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:24,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-01-10 06:51:24,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:26,348 INFO L124 PetriNetUnfolderBase]: 4320/8780 cut-off events. [2025-01-10 06:51:26,348 INFO L125 PetriNetUnfolderBase]: For 32782/33206 co-relation queries the response was YES. [2025-01-10 06:51:26,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32678 conditions, 8780 events. 4320/8780 cut-off events. For 32782/33206 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 68251 event pairs, 544 based on Foata normal form. 150/8881 useless extension candidates. Maximal degree in co-relation 32628. Up to 2335 conditions per place. [2025-01-10 06:51:26,398 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 267 selfloop transitions, 67 changer transitions 129/486 dead transitions. [2025-01-10 06:51:26,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 486 transitions, 5350 flow [2025-01-10 06:51:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 06:51:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 06:51:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 852 transitions. [2025-01-10 06:51:26,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.337827121332276 [2025-01-10 06:51:26,400 INFO L175 Difference]: Start difference. First operand has 263 places, 289 transitions, 2936 flow. Second operand 26 states and 852 transitions. [2025-01-10 06:51:26,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 486 transitions, 5350 flow [2025-01-10 06:51:26,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 486 transitions, 4936 flow, removed 28 selfloop flow, removed 21 redundant places. [2025-01-10 06:51:26,493 INFO L231 Difference]: Finished difference. Result has 254 places, 218 transitions, 2174 flow [2025-01-10 06:51:26,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2174, PETRI_PLACES=254, PETRI_TRANSITIONS=218} [2025-01-10 06:51:26,493 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 163 predicate places. [2025-01-10 06:51:26,493 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 218 transitions, 2174 flow [2025-01-10 06:51:26,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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:51:26,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:26,494 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:26,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-10 06:51:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-10 06:51:26,695 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1762525141, now seen corresponding path program 2 times [2025-01-10 06:51:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010566747] [2025-01-10 06:51:26,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:26,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-10 06:51:26,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 06:51:26,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:26,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 06:51:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010566747] [2025-01-10 06:51:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010566747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497680220] [2025-01-10 06:51:26,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:26,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:26,899 INFO L229 MonitoredProcess]: Starting monitored process 24 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:51:26,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-10 06:51:26,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-10 06:51:27,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 06:51:27,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:27,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:51:27,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:27,036 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 23 treesize of output 1 [2025-01-10 06:51:27,117 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 25 treesize of output 9 [2025-01-10 06:51:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 06:51:27,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497680220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-01-10 06:51:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174038494] [2025-01-10 06:51:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:51:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:27,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:51:27,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:51:27,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:51:27,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 218 transitions, 2174 flow. Second operand has 8 states, 8 states have (on average 50.5) internal successors, (404), 8 states have internal predecessors, (404), 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:51:27,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:27,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:51:27,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:28,056 INFO L124 PetriNetUnfolderBase]: 1844/4721 cut-off events. [2025-01-10 06:51:28,056 INFO L125 PetriNetUnfolderBase]: For 11644/11798 co-relation queries the response was YES. [2025-01-10 06:51:28,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15352 conditions, 4721 events. 1844/4721 cut-off events. For 11644/11798 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 38662 event pairs, 692 based on Foata normal form. 214/4914 useless extension candidates. Maximal degree in co-relation 15325. Up to 1532 conditions per place. [2025-01-10 06:51:28,090 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 246 selfloop transitions, 47 changer transitions 4/331 dead transitions. [2025-01-10 06:51:28,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 331 transitions, 3536 flow [2025-01-10 06:51:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:51:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:51:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 498 transitions. [2025-01-10 06:51:28,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.570446735395189 [2025-01-10 06:51:28,091 INFO L175 Difference]: Start difference. First operand has 254 places, 218 transitions, 2174 flow. Second operand 9 states and 498 transitions. [2025-01-10 06:51:28,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 331 transitions, 3536 flow [2025-01-10 06:51:28,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 331 transitions, 3074 flow, removed 15 selfloop flow, removed 33 redundant places. [2025-01-10 06:51:28,158 INFO L231 Difference]: Finished difference. Result has 206 places, 212 transitions, 1870 flow [2025-01-10 06:51:28,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1870, PETRI_PLACES=206, PETRI_TRANSITIONS=212} [2025-01-10 06:51:28,159 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 115 predicate places. [2025-01-10 06:51:28,159 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 212 transitions, 1870 flow [2025-01-10 06:51:28,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 50.5) internal successors, (404), 8 states have internal predecessors, (404), 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:51:28,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:28,159 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:28,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-10 06:51:28,360 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-01-10 06:51:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1196294367, now seen corresponding path program 2 times [2025-01-10 06:51:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991186546] [2025-01-10 06:51:28,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:28,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 06:51:28,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:51:28,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:28,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 06:51:28,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:28,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991186546] [2025-01-10 06:51:28,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991186546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:28,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790097921] [2025-01-10 06:51:28,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:28,647 INFO L229 MonitoredProcess]: Starting monitored process 25 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:51:28,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-01-10 06:51:28,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 06:51:28,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:51:28,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:51:28,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:28,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 06:51:28,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:28,872 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:51:29,057 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 19 treesize of output 7 [2025-01-10 06:51:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:29,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:29,218 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 18 treesize of output 16 [2025-01-10 06:51:29,221 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 16 [2025-01-10 06:51:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790097921] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:29,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:29,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 12] total 29 [2025-01-10 06:51:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549251451] [2025-01-10 06:51:29,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 06:51:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:29,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 06:51:29,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-01-10 06:51:29,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 97 [2025-01-10 06:51:29,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 212 transitions, 1870 flow. Second operand has 30 states, 30 states have (on average 35.166666666666664) internal successors, (1055), 30 states have internal predecessors, (1055), 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:51:29,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:29,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 97 [2025-01-10 06:51:29,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:31,246 INFO L124 PetriNetUnfolderBase]: 4005/8735 cut-off events. [2025-01-10 06:51:31,246 INFO L125 PetriNetUnfolderBase]: For 15747/16059 co-relation queries the response was YES. [2025-01-10 06:51:31,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27077 conditions, 8735 events. 4005/8735 cut-off events. For 15747/16059 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 72786 event pairs, 544 based on Foata normal form. 400/9096 useless extension candidates. Maximal degree in co-relation 27057. Up to 1152 conditions per place. [2025-01-10 06:51:31,283 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 0 selfloop transitions, 0 changer transitions 639/639 dead transitions. [2025-01-10 06:51:31,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 639 transitions, 5891 flow [2025-01-10 06:51:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 06:51:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 06:51:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1066 transitions. [2025-01-10 06:51:31,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40702558228331426 [2025-01-10 06:51:31,284 INFO L175 Difference]: Start difference. First operand has 206 places, 212 transitions, 1870 flow. Second operand 27 states and 1066 transitions. [2025-01-10 06:51:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 639 transitions, 5891 flow [2025-01-10 06:51:31,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 639 transitions, 5729 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-01-10 06:51:31,338 INFO L231 Difference]: Finished difference. Result has 218 places, 0 transitions, 0 flow [2025-01-10 06:51:31,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=0, PETRI_PLACES=218, PETRI_TRANSITIONS=0} [2025-01-10 06:51:31,338 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 127 predicate places. [2025-01-10 06:51:31,338 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 0 transitions, 0 flow [2025-01-10 06:51:31,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 35.166666666666664) internal successors, (1055), 30 states have internal predecessors, (1055), 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:51:31,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 44 remaining) [2025-01-10 06:51:31,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 44 remaining) [2025-01-10 06:51:31,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 44 remaining) [2025-01-10 06:51:31,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 44 remaining) [2025-01-10 06:51:31,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 44 remaining) [2025-01-10 06:51:31,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-10 06:51:31,545 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 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] [2025-01-10 06:51:31,556 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:51:31,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:51:31,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:51:31 BasicIcfg [2025-01-10 06:51:31,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:51:31,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:51:31,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:51:31,569 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:51:31,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:17" (3/4) ... [2025-01-10 06:51:31,577 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:51:31,581 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:51:31,581 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:51:31,590 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 221 nodes and edges [2025-01-10 06:51:31,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-01-10 06:51:31,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 06:51:31,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 06:51:31,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:51:31,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:51:31,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:51:31,731 INFO L158 Benchmark]: Toolchain (without parser) took 75328.11ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 113.8MB in the beginning and 782.0MB in the end (delta: -668.3MB). Peak memory consumption was 580.1MB. Max. memory is 16.1GB. [2025-01-10 06:51:31,732 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:31,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.40ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:31,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.11ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 98.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:31,733 INFO L158 Benchmark]: Boogie Preprocessor took 59.62ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 95.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:31,733 INFO L158 Benchmark]: RCFGBuilder took 793.89ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.2MB in the end (delta: 21.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-01-10 06:51:31,733 INFO L158 Benchmark]: TraceAbstraction took 74058.12ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 73.5MB in the beginning and 789.7MB in the end (delta: -716.2MB). Peak memory consumption was 952.3MB. Max. memory is 16.1GB. [2025-01-10 06:51:31,734 INFO L158 Benchmark]: Witness Printer took 160.21ms. Allocated memory is still 1.4GB. Free memory was 789.7MB in the beginning and 782.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:31,735 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.40ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.11ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 98.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.62ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 95.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 793.89ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.2MB in the end (delta: 21.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 74058.12ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 73.5MB in the beginning and 789.7MB in the end (delta: -716.2MB). Peak memory consumption was 952.3MB. Max. memory is 16.1GB. * Witness Printer took 160.21ms. Allocated memory is still 1.4GB. Free memory was 789.7MB in the beginning and 782.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 73.9s, OverallIterations: 39, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 50.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 71 mSolverCounterUnknown, 8905 SdHoareTripleChecker+Valid, 17.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8376 mSDsluCounter, 16424 SdHoareTripleChecker+Invalid, 15.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 944 IncrementalHoareTripleChecker+Unchecked, 16349 mSDsCounter, 669 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29492 IncrementalHoareTripleChecker+Invalid, 31176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 669 mSolverCounterUnsat, 75 mSDtfsCounter, 29492 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1920 GetRequests, 1178 SyntacticMatches, 29 SemanticMatches, 713 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5963 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3200occurred in iteration=35, InterpolantAutomatonStates: 453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1911 NumberOfCodeBlocks, 1815 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 2481 ConstructedInterpolants, 205 QuantifiedInterpolants, 24167 SizeOfPredicates, 288 NumberOfNonLiveVariables, 6139 ConjunctsInSsa, 581 ConjunctsInUnsatCore, 82 InterpolantComputations, 20 PerfectInterpolantSequences, 814/1253 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:51:31,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE