./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:56:05,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:56:05,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:56:05,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:56:05,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:56:05,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:56:05,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:56:05,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:56:05,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:56:05,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:56:05,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:56:05,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:56:05,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:56:05,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:56:05,154 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:56:05,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:56:05,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:56:05,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:56:05,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:56:05,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:56:05,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:56:05,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:56:05,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:56:05,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:56:05,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:56:05,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:56:05,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:56:05,158 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-01-10 06:56:05,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:56:05,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:56:05,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:56:05,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:56:05,511 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:56:05,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-01-10 06:56:06,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6d3d2eb/d1c42c0c7901419eb1f046fdc2da75d8/FLAG8757f0292 [2025-01-10 06:56:06,980 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:56:06,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-01-10 06:56:06,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6d3d2eb/d1c42c0c7901419eb1f046fdc2da75d8/FLAG8757f0292 [2025-01-10 06:56:07,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6d3d2eb/d1c42c0c7901419eb1f046fdc2da75d8 [2025-01-10 06:56:07,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:56:07,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:56:07,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:56:07,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:56:07,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:56:07,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07, skipping insertion in model container [2025-01-10 06:56:07,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:56:07,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:56:07,523 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:56:07,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:56:07,563 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:56:07,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07 WrapperNode [2025-01-10 06:56:07,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:56:07,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:56:07,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:56:07,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:56:07,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,607 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-01-10 06:56:07,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:56:07,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:56:07,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:56:07,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:56:07,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,645 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 06:56:07,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:56:07,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:56:07,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:56:07,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:56:07,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (1/1) ... [2025-01-10 06:56:07,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:56:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:07,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:56:07,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:56:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:56:07,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:56:07,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:56:07,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:56:07,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:56:07,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:56:07,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:56:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:56:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:56:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:56:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:56:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:56:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:56:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:56:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:56:07,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:56:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:56:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:56:07,758 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:56:07,880 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:56:07,882 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:56:08,338 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:56:08,338 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:56:08,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:56:08,679 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:56:08,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:56:08 BoogieIcfgContainer [2025-01-10 06:56:08,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:56:08,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:56:08,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:56:08,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:56:08,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:56:07" (1/3) ... [2025-01-10 06:56:08,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3eacfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:56:08, skipping insertion in model container [2025-01-10 06:56:08,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:56:07" (2/3) ... [2025-01-10 06:56:08,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3eacfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:56:08, skipping insertion in model container [2025-01-10 06:56:08,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:56:08" (3/3) ... [2025-01-10 06:56:08,686 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-01-10 06:56:08,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:56:08,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 95 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-01-10 06:56:08,700 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:56:08,774 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:56:08,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2025-01-10 06:56:08,837 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2025-01-10 06:56:08,842 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:56:08,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 244 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-01-10 06:56:08,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2025-01-10 06:56:08,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2025-01-10 06:56:08,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:56:08,870 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;@26dba832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:56:08,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-01-10 06:56:08,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:56:08,876 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:56:08,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:56:08,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:08,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:56:08,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:08,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1001612, now seen corresponding path program 1 times [2025-01-10 06:56:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-01-10 06:56:08,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:08,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:56:08,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:56:08,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:08,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:09,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-01-10 06:56:09,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366318073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:09,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332857584] [2025-01-10 06:56:09,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:09,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:09,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:09,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:09,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:09,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:09,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:09,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:09,564 INFO L124 PetriNetUnfolderBase]: 1150/2328 cut-off events. [2025-01-10 06:56:09,564 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-01-10 06:56:09,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 2328 events. 1150/2328 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16115 event pairs, 826 based on Foata normal form. 3/1740 useless extension candidates. Maximal degree in co-relation 3589. Up to 1529 conditions per place. [2025-01-10 06:56:09,580 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 42 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2025-01-10 06:56:09,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 310 flow [2025-01-10 06:56:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:56:09,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976190476190476 [2025-01-10 06:56:09,590 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:56:09,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 310 flow [2025-01-10 06:56:09,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:56:09,598 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 214 flow [2025-01-10 06:56:09,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2025-01-10 06:56:09,606 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -8 predicate places. [2025-01-10 06:56:09,606 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 214 flow [2025-01-10 06:56:09,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:09,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:09,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:56:09,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:56:09,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 31050951, now seen corresponding path program 1 times [2025-01-10 06:56:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:09,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-01-10 06:56:09,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:09,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:09,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:56:09,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:56:09,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:09,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-01-10 06:56:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653311858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:09,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547941963] [2025-01-10 06:56:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:09,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:09,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:09,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:09,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:09,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:09,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:09,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:09,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:10,022 INFO L124 PetriNetUnfolderBase]: 1153/2340 cut-off events. [2025-01-10 06:56:10,023 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-10 06:56:10,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 2340 events. 1153/2340 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16148 event pairs, 826 based on Foata normal form. 3/1756 useless extension candidates. Maximal degree in co-relation 3884. Up to 1542 conditions per place. [2025-01-10 06:56:10,043 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 49 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-01-10 06:56:10,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 105 transitions, 364 flow [2025-01-10 06:56:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-01-10 06:56:10,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-01-10 06:56:10,045 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 214 flow. Second operand 4 states and 258 transitions. [2025-01-10 06:56:10,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 105 transitions, 364 flow [2025-01-10 06:56:10,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 105 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:10,052 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 280 flow [2025-01-10 06:56:10,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2025-01-10 06:56:10,053 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -5 predicate places. [2025-01-10 06:56:10,053 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 280 flow [2025-01-10 06:56:10,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:10,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:10,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:56:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:56:10,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:10,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -222442677, now seen corresponding path program 1 times [2025-01-10 06:56:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-01-10 06:56:10,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:10,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:56:10,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:56:10,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:10,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:10,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-01-10 06:56:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837612205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:10,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:10,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:10,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774135791] [2025-01-10 06:56:10,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:10,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:10,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:10,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:10,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:10,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-01-10 06:56:10,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:10,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:10,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-01-10 06:56:10,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:10,522 INFO L124 PetriNetUnfolderBase]: 1154/2357 cut-off events. [2025-01-10 06:56:10,523 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 06:56:10,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 2357 events. 1154/2357 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16239 event pairs, 826 based on Foata normal form. 4/1771 useless extension candidates. Maximal degree in co-relation 3932. Up to 1545 conditions per place. [2025-01-10 06:56:10,534 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 63 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-01-10 06:56:10,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 436 flow [2025-01-10 06:56:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2025-01-10 06:56:10,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2025-01-10 06:56:10,536 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 280 flow. Second operand 4 states and 242 transitions. [2025-01-10 06:56:10,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 436 flow [2025-01-10 06:56:10,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:56:10,538 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 344 flow [2025-01-10 06:56:10,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-01-10 06:56:10,539 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2025-01-10 06:56:10,539 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 344 flow [2025-01-10 06:56:10,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:10,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:10,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:56:10,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:56:10,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1621904433, now seen corresponding path program 1 times [2025-01-10 06:56:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619711968] [2025-01-10 06:56:10,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:56:10,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:56:10,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:10,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:10,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619711968] [2025-01-10 06:56:10,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619711968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342406315] [2025-01-10 06:56:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:10,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:10,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:10,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:56:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:56:10,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:56:10,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:10,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:10,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:56:10,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:10,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342406315] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:10,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 06:56:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269694619] [2025-01-10 06:56:10,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:56:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:10,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:56:10,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:56:10,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:10,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:10,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:10,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:10,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:11,170 INFO L124 PetriNetUnfolderBase]: 1163/2393 cut-off events. [2025-01-10 06:56:11,171 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-01-10 06:56:11,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 2393 events. 1163/2393 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16408 event pairs, 826 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 3947. Up to 1550 conditions per place. [2025-01-10 06:56:11,181 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 52 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-01-10 06:56:11,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 654 flow [2025-01-10 06:56:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:56:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:56:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 585 transitions. [2025-01-10 06:56:11,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-01-10 06:56:11,184 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 344 flow. Second operand 10 states and 585 transitions. [2025-01-10 06:56:11,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 654 flow [2025-01-10 06:56:11,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:56:11,190 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 600 flow [2025-01-10 06:56:11,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=600, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-01-10 06:56:11,190 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-01-10 06:56:11,190 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 600 flow [2025-01-10 06:56:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:11,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:11,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:11,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:56:11,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:11,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:11,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1694212611, now seen corresponding path program 1 times [2025-01-10 06:56:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907013932] [2025-01-10 06:56:11,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:11,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:56:11,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:56:11,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:11,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907013932] [2025-01-10 06:56:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907013932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:11,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328303696] [2025-01-10 06:56:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:11,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:56:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:11,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:56:11,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:56:11,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 06:56:11,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:11,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:11,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 06:56:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:11,727 INFO L124 PetriNetUnfolderBase]: 1162/2392 cut-off events. [2025-01-10 06:56:11,727 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-01-10 06:56:11,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4187 conditions, 2392 events. 1162/2392 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16378 event pairs, 826 based on Foata normal form. 1/1810 useless extension candidates. Maximal degree in co-relation 4087. Up to 1562 conditions per place. [2025-01-10 06:56:11,740 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 55 selfloop transitions, 30 changer transitions 0/134 dead transitions. [2025-01-10 06:56:11,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 766 flow [2025-01-10 06:56:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:56:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:56:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2025-01-10 06:56:11,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6793650793650794 [2025-01-10 06:56:11,743 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 600 flow. Second operand 3 states and 214 transitions. [2025-01-10 06:56:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 766 flow [2025-01-10 06:56:11,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 671 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-01-10 06:56:11,749 INFO L231 Difference]: Finished difference. Result has 109 places, 134 transitions, 561 flow [2025-01-10 06:56:11,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=109, PETRI_TRANSITIONS=134} [2025-01-10 06:56:11,752 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-01-10 06:56:11,752 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 134 transitions, 561 flow [2025-01-10 06:56:11,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:11,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:11,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:56:11,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash -153816487, now seen corresponding path program 1 times [2025-01-10 06:56:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:11,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495630497] [2025-01-10 06:56:11,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:11,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:56:11,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:56:11,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495630497] [2025-01-10 06:56:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495630497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:11,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508326789] [2025-01-10 06:56:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:11,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:11,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:11,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:11,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 06:56:11,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 134 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:11,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:11,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 06:56:11,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:12,129 INFO L124 PetriNetUnfolderBase]: 1160/2390 cut-off events. [2025-01-10 06:56:12,129 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-01-10 06:56:12,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 2390 events. 1160/2390 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16232 event pairs, 826 based on Foata normal form. 2/1809 useless extension candidates. Maximal degree in co-relation 4064. Up to 1563 conditions per place. [2025-01-10 06:56:12,150 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 71 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-01-10 06:56:12,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 132 transitions, 714 flow [2025-01-10 06:56:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2025-01-10 06:56:12,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-01-10 06:56:12,152 INFO L175 Difference]: Start difference. First operand has 109 places, 134 transitions, 561 flow. Second operand 4 states and 275 transitions. [2025-01-10 06:56:12,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 132 transitions, 714 flow [2025-01-10 06:56:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 132 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:56:12,156 INFO L231 Difference]: Finished difference. Result has 110 places, 132 transitions, 530 flow [2025-01-10 06:56:12,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=530, PETRI_PLACES=110, PETRI_TRANSITIONS=132} [2025-01-10 06:56:12,157 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2025-01-10 06:56:12,157 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 132 transitions, 530 flow [2025-01-10 06:56:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:12,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:12,157 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:56:12,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:56:12,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:12,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1300667463, now seen corresponding path program 2 times [2025-01-10 06:56:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088200416] [2025-01-10 06:56:12,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:12,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:56:12,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:56:12,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:56:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088200416] [2025-01-10 06:56:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088200416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701040537] [2025-01-10 06:56:12,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:12,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:12,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:56:12,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:56:12,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:56:12,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:56:12,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:12,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:56:12,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:12,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701040537] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:12,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:56:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592195896] [2025-01-10 06:56:12,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:12,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:12,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:12,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:12,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 530 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:12,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:12,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:12,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:12,648 INFO L124 PetriNetUnfolderBase]: 1160/2389 cut-off events. [2025-01-10 06:56:12,649 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-01-10 06:56:12,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 2389 events. 1160/2389 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16277 event pairs, 826 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 4058. Up to 1567 conditions per place. [2025-01-10 06:56:12,655 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 70 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2025-01-10 06:56:12,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 131 transitions, 690 flow [2025-01-10 06:56:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-01-10 06:56:12,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-01-10 06:56:12,657 INFO L175 Difference]: Start difference. First operand has 110 places, 132 transitions, 530 flow. Second operand 4 states and 246 transitions. [2025-01-10 06:56:12,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 131 transitions, 690 flow [2025-01-10 06:56:12,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 131 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:56:12,659 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 537 flow [2025-01-10 06:56:12,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=110, PETRI_TRANSITIONS=131} [2025-01-10 06:56:12,659 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2025-01-10 06:56:12,659 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 131 transitions, 537 flow [2025-01-10 06:56:12,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:12,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:12,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:12,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:56:12,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:12,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 239251550, now seen corresponding path program 1 times [2025-01-10 06:56:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:12,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912001461] [2025-01-10 06:56:12,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:12,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:56:12,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:56:12,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:12,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912001461] [2025-01-10 06:56:13,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912001461] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797323358] [2025-01-10 06:56:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:13,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:13,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:13,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:13,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:56:13,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:56:13,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:56:13,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:13,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:13,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:56:13,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:13,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:13,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:13,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:13,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:13,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 06:56:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:13,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:13,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_92) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2025-01-10 06:56:13,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:13,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-10 06:56:13,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:13,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-01-10 06:56:13,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-10 06:56:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-01-10 06:56:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797323358] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:13,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 06:56:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456016737] [2025-01-10 06:56:13,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:13,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:56:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:13,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:56:13,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-01-10 06:56:13,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2025-01-10 06:56:13,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 131 transitions, 537 flow. Second operand has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:13,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:13,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2025-01-10 06:56:13,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:14,205 INFO L124 PetriNetUnfolderBase]: 1158/2392 cut-off events. [2025-01-10 06:56:14,205 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-01-10 06:56:14,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 2392 events. 1158/2392 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16271 event pairs, 826 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 4097. Up to 1529 conditions per place. [2025-01-10 06:56:14,219 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 85 selfloop transitions, 24 changer transitions 0/139 dead transitions. [2025-01-10 06:56:14,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 771 flow [2025-01-10 06:56:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 487 transitions. [2025-01-10 06:56:14,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42164502164502166 [2025-01-10 06:56:14,223 INFO L175 Difference]: Start difference. First operand has 110 places, 131 transitions, 537 flow. Second operand 11 states and 487 transitions. [2025-01-10 06:56:14,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 771 flow [2025-01-10 06:56:14,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 741 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:14,228 INFO L231 Difference]: Finished difference. Result has 116 places, 130 transitions, 553 flow [2025-01-10 06:56:14,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=553, PETRI_PLACES=116, PETRI_TRANSITIONS=130} [2025-01-10 06:56:14,229 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 16 predicate places. [2025-01-10 06:56:14,229 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 130 transitions, 553 flow [2025-01-10 06:56:14,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:14,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:14,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:14,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:56:14,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:14,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:14,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1173144560, now seen corresponding path program 1 times [2025-01-10 06:56:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:14,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605936155] [2025-01-10 06:56:14,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:14,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:56:14,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:56:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:14,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605936155] [2025-01-10 06:56:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605936155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509689121] [2025-01-10 06:56:14,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:14,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:14,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:14,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:14,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:56:14,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:56:14,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:56:14,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:14,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:14,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:56:14,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:14,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:14,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:14,993 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:14,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:15,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:15,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:56:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:15,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:15,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:15,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-10 06:56:15,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:15,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-01-10 06:56:15,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-10 06:56:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509689121] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:15,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 06:56:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647540997] [2025-01-10 06:56:15,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:56:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:15,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:56:15,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=143, Unknown=3, NotChecked=0, Total=182 [2025-01-10 06:56:15,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2025-01-10 06:56:15,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 130 transitions, 553 flow. Second operand has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:15,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:15,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2025-01-10 06:56:15,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:15,646 INFO L124 PetriNetUnfolderBase]: 1158/2391 cut-off events. [2025-01-10 06:56:15,646 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-01-10 06:56:15,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 2391 events. 1158/2391 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16307 event pairs, 826 based on Foata normal form. 1/1808 useless extension candidates. Maximal degree in co-relation 4101. Up to 1533 conditions per place. [2025-01-10 06:56:15,654 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 78 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-01-10 06:56:15,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 763 flow [2025-01-10 06:56:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 479 transitions. [2025-01-10 06:56:15,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4147186147186147 [2025-01-10 06:56:15,656 INFO L175 Difference]: Start difference. First operand has 116 places, 130 transitions, 553 flow. Second operand 11 states and 479 transitions. [2025-01-10 06:56:15,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 763 flow [2025-01-10 06:56:15,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 133 transitions, 725 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:56:15,661 INFO L231 Difference]: Finished difference. Result has 120 places, 129 transitions, 561 flow [2025-01-10 06:56:15,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=561, PETRI_PLACES=120, PETRI_TRANSITIONS=129} [2025-01-10 06:56:15,662 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2025-01-10 06:56:15,662 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 129 transitions, 561 flow [2025-01-10 06:56:15,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:15,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:15,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:15,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 06:56:15,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2007743516, now seen corresponding path program 1 times [2025-01-10 06:56:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-01-10 06:56:15,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:15,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:56:15,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:56:15,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-01-10 06:56:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156491126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479692753] [2025-01-10 06:56:16,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:16,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:16,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:56:16,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:56:16,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:56:16,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:16,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:16,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:56:16,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:16,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:16,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:16,357 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:56:16,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:56:16,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:16,402 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:16,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:16,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 06:56:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:16,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:16,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:16,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-01-10 06:56:16,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:16,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-01-10 06:56:16,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-01-10 06:56:16,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-10 06:56:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:16,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479692753] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:16,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:16,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 06:56:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273274367] [2025-01-10 06:56:16,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:16,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:56:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:16,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:56:16,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=421, Unknown=3, NotChecked=0, Total=506 [2025-01-10 06:56:17,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2025-01-10 06:56:17,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 129 transitions, 561 flow. Second operand has 23 states, 23 states have (on average 34.608695652173914) internal successors, (796), 23 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:17,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:17,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2025-01-10 06:56:17,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:17,738 INFO L124 PetriNetUnfolderBase]: 1157/2387 cut-off events. [2025-01-10 06:56:17,738 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-10 06:56:17,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4190 conditions, 2387 events. 1157/2387 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16237 event pairs, 826 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 4100. Up to 1530 conditions per place. [2025-01-10 06:56:17,745 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 80 selfloop transitions, 28 changer transitions 0/134 dead transitions. [2025-01-10 06:56:17,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 785 flow [2025-01-10 06:56:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:56:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:56:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 547 transitions. [2025-01-10 06:56:17,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37210884353741497 [2025-01-10 06:56:17,746 INFO L175 Difference]: Start difference. First operand has 120 places, 129 transitions, 561 flow. Second operand 14 states and 547 transitions. [2025-01-10 06:56:17,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 785 flow [2025-01-10 06:56:17,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 134 transitions, 733 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-01-10 06:56:17,749 INFO L231 Difference]: Finished difference. Result has 124 places, 128 transitions, 573 flow [2025-01-10 06:56:17,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=573, PETRI_PLACES=124, PETRI_TRANSITIONS=128} [2025-01-10 06:56:17,750 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 24 predicate places. [2025-01-10 06:56:17,750 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 128 transitions, 573 flow [2025-01-10 06:56:17,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 34.608695652173914) internal successors, (796), 23 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:17,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:17,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:17,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:56:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:56:17,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2110505882, now seen corresponding path program 1 times [2025-01-10 06:56:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181163186] [2025-01-10 06:56:17,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:17,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:56:17,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:56:17,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:17,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181163186] [2025-01-10 06:56:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181163186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967868610] [2025-01-10 06:56:18,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:18,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:18,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:18,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:18,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:56:18,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:56:18,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:56:18,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:18,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:18,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:56:18,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:18,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:18,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:18,562 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:56:18,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:56:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:18,628 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:18,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:18,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:18,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:56:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:18,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:18,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_178) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-01-10 06:56:18,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:18,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-10 06:56:18,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:18,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2025-01-10 06:56:18,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-01-10 06:56:18,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 06:56:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-10 06:56:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967868610] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:19,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-10 06:56:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306410323] [2025-01-10 06:56:19,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:19,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:56:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:19,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:56:19,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=426, Unknown=2, NotChecked=42, Total=552 [2025-01-10 06:56:19,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2025-01-10 06:56:19,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 573 flow. Second operand has 24 states, 24 states have (on average 34.583333333333336) internal successors, (830), 24 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:19,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:19,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2025-01-10 06:56:19,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:19,885 INFO L124 PetriNetUnfolderBase]: 1157/2387 cut-off events. [2025-01-10 06:56:19,886 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-10 06:56:19,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 2387 events. 1157/2387 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16267 event pairs, 826 based on Foata normal form. 4/1812 useless extension candidates. Maximal degree in co-relation 4135. Up to 1534 conditions per place. [2025-01-10 06:56:19,895 INFO L140 encePairwiseOnDemand]: 84/105 looper letters, 74 selfloop transitions, 32 changer transitions 1/133 dead transitions. [2025-01-10 06:56:19,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 133 transitions, 809 flow [2025-01-10 06:56:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:56:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:56:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 639 transitions. [2025-01-10 06:56:19,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35798319327731093 [2025-01-10 06:56:19,897 INFO L175 Difference]: Start difference. First operand has 124 places, 128 transitions, 573 flow. Second operand 17 states and 639 transitions. [2025-01-10 06:56:19,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 133 transitions, 809 flow [2025-01-10 06:56:19,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 789 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:19,900 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 646 flow [2025-01-10 06:56:19,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=646, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-01-10 06:56:19,900 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2025-01-10 06:56:19,900 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 646 flow [2025-01-10 06:56:19,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 34.583333333333336) internal successors, (830), 24 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:19,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:19,901 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:19,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:56:20,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:56:20,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -367162844, now seen corresponding path program 1 times [2025-01-10 06:56:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431427974] [2025-01-10 06:56:20,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:56:20,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:56:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:56:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431427974] [2025-01-10 06:56:20,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431427974] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533687710] [2025-01-10 06:56:20,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:20,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:20,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:20,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:56:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:56:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:56:20,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:20,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:20,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:56:20,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:56:20,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:56:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533687710] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:20,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-10 06:56:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021670127] [2025-01-10 06:56:20,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:20,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:56:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:56:20,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:56:20,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:20,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 646 flow. Second operand has 19 states, 19 states have (on average 50.21052631578947) internal successors, (954), 19 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:20,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:20,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:20,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:21,216 INFO L124 PetriNetUnfolderBase]: 2301/4722 cut-off events. [2025-01-10 06:56:21,216 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-01-10 06:56:21,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8228 conditions, 4722 events. 2301/4722 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34343 event pairs, 1652 based on Foata normal form. 2/3585 useless extension candidates. Maximal degree in co-relation 8176. Up to 1551 conditions per place. [2025-01-10 06:56:21,234 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 94 selfloop transitions, 43 changer transitions 0/180 dead transitions. [2025-01-10 06:56:21,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 180 transitions, 1145 flow [2025-01-10 06:56:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:56:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:56:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 599 transitions. [2025-01-10 06:56:21,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5704761904761905 [2025-01-10 06:56:21,236 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 646 flow. Second operand 10 states and 599 transitions. [2025-01-10 06:56:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 180 transitions, 1145 flow [2025-01-10 06:56:21,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 180 transitions, 1079 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-10 06:56:21,241 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 743 flow [2025-01-10 06:56:21,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=743, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2025-01-10 06:56:21,241 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-01-10 06:56:21,241 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 743 flow [2025-01-10 06:56:21,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 50.21052631578947) internal successors, (954), 19 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:21,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:21,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:21,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:56:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:21,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:21,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash -730014116, now seen corresponding path program 1 times [2025-01-10 06:56:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515414845] [2025-01-10 06:56:21,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:21,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:56:21,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:56:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:56:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515414845] [2025-01-10 06:56:21,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515414845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:21,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:56:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372854327] [2025-01-10 06:56:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:21,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:21,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:21,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:21,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 105 [2025-01-10 06:56:21,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 743 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:21,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:21,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 105 [2025-01-10 06:56:21,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:21,896 INFO L124 PetriNetUnfolderBase]: 2301/4710 cut-off events. [2025-01-10 06:56:21,896 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-01-10 06:56:21,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8247 conditions, 4710 events. 2301/4710 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34418 event pairs, 1652 based on Foata normal form. 2/3560 useless extension candidates. Maximal degree in co-relation 8194. Up to 3107 conditions per place. [2025-01-10 06:56:21,914 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 87 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-01-10 06:56:21,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 961 flow [2025-01-10 06:56:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:56:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:56:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-01-10 06:56:21,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2025-01-10 06:56:21,917 INFO L175 Difference]: Start difference. First operand has 140 places, 137 transitions, 743 flow. Second operand 6 states and 303 transitions. [2025-01-10 06:56:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 961 flow [2025-01-10 06:56:21,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 139 transitions, 889 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:56:21,921 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 741 flow [2025-01-10 06:56:21,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2025-01-10 06:56:21,922 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2025-01-10 06:56:21,922 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 741 flow [2025-01-10 06:56:21,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:21,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:21,923 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-01-10 06:56:21,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:56:21,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:21,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash 275248526, now seen corresponding path program 2 times [2025-01-10 06:56:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528394140] [2025-01-10 06:56:21,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:21,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:56:21,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:56:21,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:21,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:56:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528394140] [2025-01-10 06:56:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528394140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144746027] [2025-01-10 06:56:21,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:21,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:21,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:22,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:22,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:56:22,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:56:22,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:56:22,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:22,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:56:22,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:56:22,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:56:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144746027] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:22,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:56:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804300402] [2025-01-10 06:56:22,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:22,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:22,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:22,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:22,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 741 flow. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:22,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:22,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:22,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:22,636 INFO L124 PetriNetUnfolderBase]: 2303/4708 cut-off events. [2025-01-10 06:56:22,636 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-01-10 06:56:22,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8221 conditions, 4708 events. 2303/4708 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34382 event pairs, 1652 based on Foata normal form. 2/3558 useless extension candidates. Maximal degree in co-relation 8168. Up to 3075 conditions per place. [2025-01-10 06:56:22,658 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 54 selfloop transitions, 40 changer transitions 0/137 dead transitions. [2025-01-10 06:56:22,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 909 flow [2025-01-10 06:56:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:56:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:56:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2025-01-10 06:56:22,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-01-10 06:56:22,667 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 741 flow. Second operand 5 states and 294 transitions. [2025-01-10 06:56:22,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 909 flow [2025-01-10 06:56:22,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 137 transitions, 849 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 06:56:22,672 INFO L231 Difference]: Finished difference. Result has 135 places, 137 transitions, 741 flow [2025-01-10 06:56:22,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=741, PETRI_PLACES=135, PETRI_TRANSITIONS=137} [2025-01-10 06:56:22,676 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 35 predicate places. [2025-01-10 06:56:22,676 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 137 transitions, 741 flow [2025-01-10 06:56:22,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:22,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:22,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:22,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:22,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:22,877 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:22,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1654979838, now seen corresponding path program 1 times [2025-01-10 06:56:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355248157] [2025-01-10 06:56:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:22,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:56:22,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:56:22,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:22,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:56:22,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:22,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355248157] [2025-01-10 06:56:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355248157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:22,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:22,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3288627] [2025-01-10 06:56:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:22,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:22,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:22,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-01-10 06:56:22,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 137 transitions, 741 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:22,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:22,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-01-10 06:56:22,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:23,890 INFO L124 PetriNetUnfolderBase]: 4863/8344 cut-off events. [2025-01-10 06:56:23,890 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-01-10 06:56:23,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15436 conditions, 8344 events. 4863/8344 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 59006 event pairs, 2748 based on Foata normal form. 244/6238 useless extension candidates. Maximal degree in co-relation 15390. Up to 5080 conditions per place. [2025-01-10 06:56:23,925 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 133 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2025-01-10 06:56:23,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 178 transitions, 1101 flow [2025-01-10 06:56:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2025-01-10 06:56:23,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-01-10 06:56:23,927 INFO L175 Difference]: Start difference. First operand has 135 places, 137 transitions, 741 flow. Second operand 4 states and 304 transitions. [2025-01-10 06:56:23,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 178 transitions, 1101 flow [2025-01-10 06:56:23,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 178 transitions, 1026 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:23,930 INFO L231 Difference]: Finished difference. Result has 137 places, 140 transitions, 695 flow [2025-01-10 06:56:23,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=137, PETRI_TRANSITIONS=140} [2025-01-10 06:56:23,931 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 37 predicate places. [2025-01-10 06:56:23,931 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 140 transitions, 695 flow [2025-01-10 06:56:23,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:23,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:23,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:56:23,931 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1387060442, now seen corresponding path program 1 times [2025-01-10 06:56:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831501061] [2025-01-10 06:56:23,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:56:23,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:56:23,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:23,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:56:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831501061] [2025-01-10 06:56:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831501061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:56:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506182563] [2025-01-10 06:56:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:23,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:56:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:23,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:56:23,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:56:23,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-01-10 06:56:23,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 140 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:23,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:23,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-01-10 06:56:23,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:25,203 INFO L124 PetriNetUnfolderBase]: 6085/11342 cut-off events. [2025-01-10 06:56:25,203 INFO L125 PetriNetUnfolderBase]: For 3837/4169 co-relation queries the response was YES. [2025-01-10 06:56:25,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23735 conditions, 11342 events. 6085/11342 cut-off events. For 3837/4169 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 89707 event pairs, 2656 based on Foata normal form. 0/8756 useless extension candidates. Maximal degree in co-relation 23687. Up to 4974 conditions per place. [2025-01-10 06:56:25,252 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 116 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2025-01-10 06:56:25,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 162 transitions, 998 flow [2025-01-10 06:56:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:56:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:56:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-01-10 06:56:25,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-01-10 06:56:25,254 INFO L175 Difference]: Start difference. First operand has 137 places, 140 transitions, 695 flow. Second operand 3 states and 233 transitions. [2025-01-10 06:56:25,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 162 transitions, 998 flow [2025-01-10 06:56:25,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 162 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:25,261 INFO L231 Difference]: Finished difference. Result has 139 places, 142 transitions, 713 flow [2025-01-10 06:56:25,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=139, PETRI_TRANSITIONS=142} [2025-01-10 06:56:25,262 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2025-01-10 06:56:25,262 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 142 transitions, 713 flow [2025-01-10 06:56:25,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:25,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:25,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:25,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:56:25,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:25,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1387060447, now seen corresponding path program 1 times [2025-01-10 06:56:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760554235] [2025-01-10 06:56:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:25,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:56:25,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:56:25,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:25,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760554235] [2025-01-10 06:56:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760554235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024962227] [2025-01-10 06:56:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:25,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:25,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:25,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:25,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:56:25,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:56:25,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:56:25,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:25,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:25,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:56:25,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:25,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024962227] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:25,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:25,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 06:56:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510636287] [2025-01-10 06:56:25,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:25,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:56:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:25,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:56:25,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:56:25,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-01-10 06:56:25,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 142 transitions, 713 flow. Second operand has 15 states, 15 states have (on average 50.06666666666667) internal successors, (751), 15 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:25,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:25,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-01-10 06:56:25,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:26,624 INFO L124 PetriNetUnfolderBase]: 3768/7290 cut-off events. [2025-01-10 06:56:26,625 INFO L125 PetriNetUnfolderBase]: For 2714/3049 co-relation queries the response was YES. [2025-01-10 06:56:26,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15340 conditions, 7290 events. 3768/7290 cut-off events. For 2714/3049 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 51887 event pairs, 2538 based on Foata normal form. 77/5946 useless extension candidates. Maximal degree in co-relation 15291. Up to 4264 conditions per place. [2025-01-10 06:56:26,666 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 110 selfloop transitions, 45 changer transitions 0/197 dead transitions. [2025-01-10 06:56:26,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 197 transitions, 1244 flow [2025-01-10 06:56:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 639 transitions. [2025-01-10 06:56:26,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-01-10 06:56:26,668 INFO L175 Difference]: Start difference. First operand has 139 places, 142 transitions, 713 flow. Second operand 11 states and 639 transitions. [2025-01-10 06:56:26,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 197 transitions, 1244 flow [2025-01-10 06:56:26,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 197 transitions, 1239 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:26,675 INFO L231 Difference]: Finished difference. Result has 150 places, 144 transitions, 820 flow [2025-01-10 06:56:26,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=150, PETRI_TRANSITIONS=144} [2025-01-10 06:56:26,676 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 50 predicate places. [2025-01-10 06:56:26,676 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 144 transitions, 820 flow [2025-01-10 06:56:26,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.06666666666667) internal successors, (751), 15 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:26,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:26,677 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:26,686 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:56:26,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:26,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1573695725, now seen corresponding path program 1 times [2025-01-10 06:56:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841870572] [2025-01-10 06:56:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:26,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:56:26,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:56:26,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:26,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:56:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841870572] [2025-01-10 06:56:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841870572] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443883891] [2025-01-10 06:56:26,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:26,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:26,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:26,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:56:27,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:56:27,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:56:27,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:27,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:27,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:56:27,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:56:27,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:56:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443883891] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:27,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 06:56:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376175175] [2025-01-10 06:56:27,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:27,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:56:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:27,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:56:27,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:56:27,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:56:27,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 144 transitions, 820 flow. Second operand has 15 states, 15 states have (on average 51.0) internal successors, (765), 15 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:27,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:27,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:56:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:28,136 INFO L124 PetriNetUnfolderBase]: 3163/6334 cut-off events. [2025-01-10 06:56:28,136 INFO L125 PetriNetUnfolderBase]: For 2783/2904 co-relation queries the response was YES. [2025-01-10 06:56:28,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13470 conditions, 6334 events. 3163/6334 cut-off events. For 2783/2904 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 49035 event pairs, 2184 based on Foata normal form. 38/5105 useless extension candidates. Maximal degree in co-relation 13419. Up to 3850 conditions per place. [2025-01-10 06:56:28,180 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 100 selfloop transitions, 45 changer transitions 0/188 dead transitions. [2025-01-10 06:56:28,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 188 transitions, 1287 flow [2025-01-10 06:56:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:56:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:56:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 646 transitions. [2025-01-10 06:56:28,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5593073593073593 [2025-01-10 06:56:28,183 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 820 flow. Second operand 11 states and 646 transitions. [2025-01-10 06:56:28,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 188 transitions, 1287 flow [2025-01-10 06:56:28,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 188 transitions, 1203 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 06:56:28,195 INFO L231 Difference]: Finished difference. Result has 154 places, 146 transitions, 846 flow [2025-01-10 06:56:28,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=846, PETRI_PLACES=154, PETRI_TRANSITIONS=146} [2025-01-10 06:56:28,196 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 54 predicate places. [2025-01-10 06:56:28,196 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 146 transitions, 846 flow [2025-01-10 06:56:28,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 51.0) internal successors, (765), 15 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:28,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:28,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:28,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:56:28,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:56:28,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1409257645, now seen corresponding path program 1 times [2025-01-10 06:56:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049328730] [2025-01-10 06:56:28,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:28,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:56:28,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:56:28,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:28,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:56:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:28,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049328730] [2025-01-10 06:56:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049328730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:28,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:28,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147993713] [2025-01-10 06:56:28,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:28,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:28,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:28,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:28,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:28,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 06:56:28,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 146 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:28,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:28,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 06:56:28,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:29,768 INFO L124 PetriNetUnfolderBase]: 7309/12773 cut-off events. [2025-01-10 06:56:29,769 INFO L125 PetriNetUnfolderBase]: For 9394/9804 co-relation queries the response was YES. [2025-01-10 06:56:29,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30199 conditions, 12773 events. 7309/12773 cut-off events. For 9394/9804 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 94356 event pairs, 3698 based on Foata normal form. 231/10511 useless extension candidates. Maximal degree in co-relation 30112. Up to 6584 conditions per place. [2025-01-10 06:56:29,859 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 168 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2025-01-10 06:56:29,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 211 transitions, 1473 flow [2025-01-10 06:56:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2025-01-10 06:56:29,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-01-10 06:56:29,861 INFO L175 Difference]: Start difference. First operand has 154 places, 146 transitions, 846 flow. Second operand 4 states and 304 transitions. [2025-01-10 06:56:29,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 211 transitions, 1473 flow [2025-01-10 06:56:29,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 211 transitions, 1389 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 06:56:29,875 INFO L231 Difference]: Finished difference. Result has 151 places, 148 transitions, 784 flow [2025-01-10 06:56:29,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=151, PETRI_TRANSITIONS=148} [2025-01-10 06:56:29,875 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 51 predicate places. [2025-01-10 06:56:29,875 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 148 transitions, 784 flow [2025-01-10 06:56:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:29,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:29,876 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:29,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:56:29,876 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:29,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 284098108, now seen corresponding path program 2 times [2025-01-10 06:56:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:29,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309008779] [2025-01-10 06:56:29,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:29,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 06:56:29,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:29,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:56:30,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309008779] [2025-01-10 06:56:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309008779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120051772] [2025-01-10 06:56:30,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:30,179 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:30,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:56:30,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 06:56:30,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:30,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:30,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 06:56:30,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:30,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:30,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:30,412 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:30,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:30,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:30,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:56:30,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:30,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_384) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2025-01-10 06:56:30,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:30,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-01-10 06:56:30,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:30,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-01-10 06:56:30,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 06:56:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2025-01-10 06:56:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120051772] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:30,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 24 [2025-01-10 06:56:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282789071] [2025-01-10 06:56:30,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:30,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 06:56:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:30,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 06:56:30,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=477, Unknown=1, NotChecked=44, Total=600 [2025-01-10 06:56:30,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:30,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 148 transitions, 784 flow. Second operand has 25 states, 25 states have (on average 47.2) internal successors, (1180), 25 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:30,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:30,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:30,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:32,118 INFO L124 PetriNetUnfolderBase]: 5847/9772 cut-off events. [2025-01-10 06:56:32,118 INFO L125 PetriNetUnfolderBase]: For 9201/10279 co-relation queries the response was YES. [2025-01-10 06:56:32,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25807 conditions, 9772 events. 5847/9772 cut-off events. For 9201/10279 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 65360 event pairs, 1461 based on Foata normal form. 226/8437 useless extension candidates. Maximal degree in co-relation 25684. Up to 2739 conditions per place. [2025-01-10 06:56:32,180 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 165 selfloop transitions, 43 changer transitions 0/247 dead transitions. [2025-01-10 06:56:32,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 247 transitions, 1611 flow [2025-01-10 06:56:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:56:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:56:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 853 transitions. [2025-01-10 06:56:32,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5077380952380952 [2025-01-10 06:56:32,183 INFO L175 Difference]: Start difference. First operand has 151 places, 148 transitions, 784 flow. Second operand 16 states and 853 transitions. [2025-01-10 06:56:32,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 247 transitions, 1611 flow [2025-01-10 06:56:32,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 247 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:32,195 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 927 flow [2025-01-10 06:56:32,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=927, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2025-01-10 06:56:32,195 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 67 predicate places. [2025-01-10 06:56:32,195 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 927 flow [2025-01-10 06:56:32,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 47.2) internal successors, (1180), 25 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:32,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:32,197 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:32,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 06:56:32,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:32,401 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:32,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 284098109, now seen corresponding path program 1 times [2025-01-10 06:56:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:32,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696936172] [2025-01-10 06:56:32,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:32,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:32,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:32,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696936172] [2025-01-10 06:56:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696936172] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165263370] [2025-01-10 06:56:32,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:32,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:32,933 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:32,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:56:33,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:33,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:33,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:33,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:33,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 06:56:33,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:33,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:33,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 06:56:33,123 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:33,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:33,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:33,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:56:33,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:33,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:33,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-10 06:56:33,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:33,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-01-10 06:56:33,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:56:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:56:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165263370] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:33,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-01-10 06:56:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028781802] [2025-01-10 06:56:33,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:33,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 06:56:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:33,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 06:56:33,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=565, Unknown=2, NotChecked=0, Total=650 [2025-01-10 06:56:33,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:33,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 927 flow. Second operand has 26 states, 26 states have (on average 47.11538461538461) internal successors, (1225), 26 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:33,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:33,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:33,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:35,046 INFO L124 PetriNetUnfolderBase]: 5639/9757 cut-off events. [2025-01-10 06:56:35,050 INFO L125 PetriNetUnfolderBase]: For 12070/12992 co-relation queries the response was YES. [2025-01-10 06:56:35,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 9757 events. 5639/9757 cut-off events. For 12070/12992 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 66464 event pairs, 1468 based on Foata normal form. 187/8435 useless extension candidates. Maximal degree in co-relation 27581. Up to 2569 conditions per place. [2025-01-10 06:56:35,112 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 148 selfloop transitions, 43 changer transitions 0/230 dead transitions. [2025-01-10 06:56:35,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 230 transitions, 1622 flow [2025-01-10 06:56:35,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:56:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:56:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 796 transitions. [2025-01-10 06:56:35,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053968253968254 [2025-01-10 06:56:35,117 INFO L175 Difference]: Start difference. First operand has 167 places, 154 transitions, 927 flow. Second operand 15 states and 796 transitions. [2025-01-10 06:56:35,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 230 transitions, 1622 flow [2025-01-10 06:56:35,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 230 transitions, 1571 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 06:56:35,152 INFO L231 Difference]: Finished difference. Result has 175 places, 153 transitions, 958 flow [2025-01-10 06:56:35,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=958, PETRI_PLACES=175, PETRI_TRANSITIONS=153} [2025-01-10 06:56:35,153 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 75 predicate places. [2025-01-10 06:56:35,153 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 153 transitions, 958 flow [2025-01-10 06:56:35,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 47.11538461538461) internal successors, (1225), 26 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:35,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:35,157 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:35,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 06:56:35,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:35,360 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:35,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 284098111, now seen corresponding path program 1 times [2025-01-10 06:56:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235342851] [2025-01-10 06:56:35,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:35,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:35,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:35,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:35,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235342851] [2025-01-10 06:56:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235342851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312306588] [2025-01-10 06:56:35,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:35,753 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:35,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:56:35,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:35,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:35,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:35,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-10 06:56:35,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:35,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:35,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:35,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:35,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:35,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:36,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 06:56:36,073 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 06:56:36,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 18 treesize of output 17 [2025-01-10 06:56:36,156 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-10 06:56:36,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 21 [2025-01-10 06:56:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:36,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:36,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:36,331 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2025-01-10 06:56:36,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< (+ (select v_arrayElimArr_7 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-01-10 06:56:36,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)))) (< (+ 2147483648 (select v_arrayElimArr_7 4)) 0))) is different from false [2025-01-10 06:56:36,354 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| Int)) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_465) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_230| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)))) (< (+ 2147483648 (select v_arrayElimArr_7 4)) 0))) is different from false [2025-01-10 06:56:36,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:36,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-10 06:56:36,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:36,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2025-01-10 06:56:36,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:36,435 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 69 treesize of output 67 [2025-01-10 06:56:36,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-10 06:56:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-10 06:56:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312306588] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:36,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 29 [2025-01-10 06:56:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417673609] [2025-01-10 06:56:36,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 06:56:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:36,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 06:56:36,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=661, Unknown=3, NotChecked=162, Total=930 [2025-01-10 06:56:36,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:36,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 153 transitions, 958 flow. Second operand has 31 states, 31 states have (on average 46.70967741935484) internal successors, (1448), 31 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:36,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:36,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:36,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:38,212 INFO L124 PetriNetUnfolderBase]: 5620/9575 cut-off events. [2025-01-10 06:56:38,213 INFO L125 PetriNetUnfolderBase]: For 13095/14098 co-relation queries the response was YES. [2025-01-10 06:56:38,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28980 conditions, 9575 events. 5620/9575 cut-off events. For 13095/14098 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 64773 event pairs, 2947 based on Foata normal form. 213/8692 useless extension candidates. Maximal degree in co-relation 28821. Up to 4890 conditions per place. [2025-01-10 06:56:38,275 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 154 selfloop transitions, 42 changer transitions 0/235 dead transitions. [2025-01-10 06:56:38,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 235 transitions, 1724 flow [2025-01-10 06:56:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:56:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:56:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 799 transitions. [2025-01-10 06:56:38,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073015873015873 [2025-01-10 06:56:38,279 INFO L175 Difference]: Start difference. First operand has 175 places, 153 transitions, 958 flow. Second operand 15 states and 799 transitions. [2025-01-10 06:56:38,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 235 transitions, 1724 flow [2025-01-10 06:56:38,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 235 transitions, 1646 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-01-10 06:56:38,299 INFO L231 Difference]: Finished difference. Result has 178 places, 157 transitions, 1043 flow [2025-01-10 06:56:38,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1043, PETRI_PLACES=178, PETRI_TRANSITIONS=157} [2025-01-10 06:56:38,299 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 78 predicate places. [2025-01-10 06:56:38,299 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 157 transitions, 1043 flow [2025-01-10 06:56:38,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 46.70967741935484) internal successors, (1448), 31 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:38,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:38,300 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:38,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 06:56:38,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:38,501 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:38,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 284098112, now seen corresponding path program 1 times [2025-01-10 06:56:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375299508] [2025-01-10 06:56:38,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:38,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:38,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:38,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:38,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:56:38,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:38,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375299508] [2025-01-10 06:56:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375299508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351475432] [2025-01-10 06:56:38,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:38,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:38,893 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:38,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 06:56:38,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:56:38,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:56:38,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:38,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:38,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-10 06:56:38,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:38,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 06:56:39,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:56:39,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 06:56:39,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 06:56:39,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:39,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:56:39,150 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 06:56:39,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2025-01-10 06:56:39,223 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-10 06:56:39,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 [2025-01-10 06:56:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:56:39,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:39,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:39,414 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-10 06:56:39,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648) (< 2147483647 (select v_arrayElimArr_9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2025-01-10 06:56:43,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:43,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-01-10 06:56:43,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:43,691 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 71 treesize of output 65 [2025-01-10 06:56:43,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:56:43,701 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 59 treesize of output 57 [2025-01-10 06:56:43,707 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 24 treesize of output 20 [2025-01-10 06:56:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-01-10 06:56:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351475432] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:43,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 29 [2025-01-10 06:56:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320589186] [2025-01-10 06:56:43,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:43,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 06:56:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:43,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 06:56:43,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=730, Unknown=35, NotChecked=56, Total=930 [2025-01-10 06:56:43,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-01-10 06:56:43,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 157 transitions, 1043 flow. Second operand has 31 states, 31 states have (on average 46.70967741935484) internal successors, (1448), 31 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:43,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:43,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-01-10 06:56:43,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:46,065 INFO L124 PetriNetUnfolderBase]: 5413/9607 cut-off events. [2025-01-10 06:56:46,065 INFO L125 PetriNetUnfolderBase]: For 17831/18681 co-relation queries the response was YES. [2025-01-10 06:56:46,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28919 conditions, 9607 events. 5413/9607 cut-off events. For 17831/18681 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 66529 event pairs, 2690 based on Foata normal form. 171/8724 useless extension candidates. Maximal degree in co-relation 28758. Up to 4890 conditions per place. [2025-01-10 06:56:46,129 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 153 selfloop transitions, 42 changer transitions 0/234 dead transitions. [2025-01-10 06:56:46,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 234 transitions, 1748 flow [2025-01-10 06:56:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:56:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:56:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 798 transitions. [2025-01-10 06:56:46,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-01-10 06:56:46,132 INFO L175 Difference]: Start difference. First operand has 178 places, 157 transitions, 1043 flow. Second operand 15 states and 798 transitions. [2025-01-10 06:56:46,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 234 transitions, 1748 flow [2025-01-10 06:56:46,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 234 transitions, 1704 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:56:46,153 INFO L231 Difference]: Finished difference. Result has 188 places, 156 transitions, 1079 flow [2025-01-10 06:56:46,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1079, PETRI_PLACES=188, PETRI_TRANSITIONS=156} [2025-01-10 06:56:46,153 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 88 predicate places. [2025-01-10 06:56:46,153 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 156 transitions, 1079 flow [2025-01-10 06:56:46,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 46.70967741935484) internal successors, (1448), 31 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:46,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:46,154 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:46,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 06:56:46,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 06:56:46,358 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:46,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1307388072, now seen corresponding path program 2 times [2025-01-10 06:56:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:46,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-01-10 06:56:46,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:56:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:46,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 06:56:46,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:56:46,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:56:46,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-01-10 06:56:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913904592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:56:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138776449] [2025-01-10 06:56:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:46,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:46,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:46,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:46,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 06:56:46,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 156 transitions, 1079 flow. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:46,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:46,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 06:56:46,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:47,305 INFO L124 PetriNetUnfolderBase]: 5726/9400 cut-off events. [2025-01-10 06:56:47,306 INFO L125 PetriNetUnfolderBase]: For 23927/24679 co-relation queries the response was YES. [2025-01-10 06:56:47,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31113 conditions, 9400 events. 5726/9400 cut-off events. For 23927/24679 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 62187 event pairs, 1547 based on Foata normal form. 419/8910 useless extension candidates. Maximal degree in co-relation 30952. Up to 3400 conditions per place. [2025-01-10 06:56:47,374 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 157 selfloop transitions, 9 changer transitions 0/207 dead transitions. [2025-01-10 06:56:47,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 207 transitions, 1763 flow [2025-01-10 06:56:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-01-10 06:56:47,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-01-10 06:56:47,376 INFO L175 Difference]: Start difference. First operand has 188 places, 156 transitions, 1079 flow. Second operand 4 states and 296 transitions. [2025-01-10 06:56:47,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 207 transitions, 1763 flow [2025-01-10 06:56:47,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 207 transitions, 1683 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-10 06:56:47,401 INFO L231 Difference]: Finished difference. Result has 178 places, 155 transitions, 1023 flow [2025-01-10 06:56:47,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1023, PETRI_PLACES=178, PETRI_TRANSITIONS=155} [2025-01-10 06:56:47,402 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 78 predicate places. [2025-01-10 06:56:47,402 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 155 transitions, 1023 flow [2025-01-10 06:56:47,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:47,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:47,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:47,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:56:47,402 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:47,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1859584572, now seen corresponding path program 1 times [2025-01-10 06:56:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:47,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-01-10 06:56:47,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:47,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:56:47,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:56:47,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-01-10 06:56:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586430102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:47,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:56:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862392976] [2025-01-10 06:56:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:47,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:56:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:56:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:56:47,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-01-10 06:56:47,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 155 transitions, 1023 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:47,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:47,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-01-10 06:56:47,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:48,458 INFO L124 PetriNetUnfolderBase]: 5332/8968 cut-off events. [2025-01-10 06:56:48,459 INFO L125 PetriNetUnfolderBase]: For 24437/25091 co-relation queries the response was YES. [2025-01-10 06:56:48,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30606 conditions, 8968 events. 5332/8968 cut-off events. For 24437/25091 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 59521 event pairs, 3277 based on Foata normal form. 407/8821 useless extension candidates. Maximal degree in co-relation 30445. Up to 6010 conditions per place. [2025-01-10 06:56:48,527 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 140 selfloop transitions, 10 changer transitions 0/190 dead transitions. [2025-01-10 06:56:48,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 190 transitions, 1497 flow [2025-01-10 06:56:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:56:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:56:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2025-01-10 06:56:48,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-01-10 06:56:48,528 INFO L175 Difference]: Start difference. First operand has 178 places, 155 transitions, 1023 flow. Second operand 4 states and 288 transitions. [2025-01-10 06:56:48,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 190 transitions, 1497 flow [2025-01-10 06:56:48,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 190 transitions, 1447 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:48,546 INFO L231 Difference]: Finished difference. Result has 180 places, 156 transitions, 1044 flow [2025-01-10 06:56:48,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1044, PETRI_PLACES=180, PETRI_TRANSITIONS=156} [2025-01-10 06:56:48,546 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 80 predicate places. [2025-01-10 06:56:48,546 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 156 transitions, 1044 flow [2025-01-10 06:56:48,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:48,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:48,547 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:56:48,547 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:48,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1874323493, now seen corresponding path program 1 times [2025-01-10 06:56:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481560194] [2025-01-10 06:56:48,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:48,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:56:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:56:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481560194] [2025-01-10 06:56:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481560194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056640750] [2025-01-10 06:56:48,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:48,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:48,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:48,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:48,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 06:56:48,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:56:48,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:56:48,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:48,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:48,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:56:48,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:48,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:56:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056640750] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:48,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:56:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697226770] [2025-01-10 06:56:48,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:56:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:56:48,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:56:48,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-01-10 06:56:48,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 156 transitions, 1044 flow. Second operand has 12 states, 12 states have (on average 55.25) internal successors, (663), 12 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:48,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:48,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-01-10 06:56:48,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:50,363 INFO L124 PetriNetUnfolderBase]: 8252/13450 cut-off events. [2025-01-10 06:56:50,364 INFO L125 PetriNetUnfolderBase]: For 38341/39431 co-relation queries the response was YES. [2025-01-10 06:56:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44684 conditions, 13450 events. 8252/13450 cut-off events. For 38341/39431 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 93493 event pairs, 2661 based on Foata normal form. 321/12328 useless extension candidates. Maximal degree in co-relation 44521. Up to 5596 conditions per place. [2025-01-10 06:56:50,485 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 297 selfloop transitions, 15 changer transitions 0/355 dead transitions. [2025-01-10 06:56:50,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 355 transitions, 2932 flow [2025-01-10 06:56:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:56:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:56:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 745 transitions. [2025-01-10 06:56:50,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7095238095238096 [2025-01-10 06:56:50,487 INFO L175 Difference]: Start difference. First operand has 180 places, 156 transitions, 1044 flow. Second operand 10 states and 745 transitions. [2025-01-10 06:56:50,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 355 transitions, 2932 flow [2025-01-10 06:56:50,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 355 transitions, 2893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:50,521 INFO L231 Difference]: Finished difference. Result has 191 places, 165 transitions, 1119 flow [2025-01-10 06:56:50,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1119, PETRI_PLACES=191, PETRI_TRANSITIONS=165} [2025-01-10 06:56:50,521 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 91 predicate places. [2025-01-10 06:56:50,521 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 165 transitions, 1119 flow [2025-01-10 06:56:50,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 55.25) internal successors, (663), 12 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:50,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:50,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:50,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 06:56:50,723 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash 962386623, now seen corresponding path program 1 times [2025-01-10 06:56:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451583631] [2025-01-10 06:56:50,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:50,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:50,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:56:50,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:56:50,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:50,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:56:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451583631] [2025-01-10 06:56:50,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451583631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:50,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:56:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611663376] [2025-01-10 06:56:50,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:56:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:50,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:56:50,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:56:50,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-01-10 06:56:50,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 165 transitions, 1119 flow. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:50,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:50,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-01-10 06:56:50,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:52,256 INFO L124 PetriNetUnfolderBase]: 10409/17998 cut-off events. [2025-01-10 06:56:52,256 INFO L125 PetriNetUnfolderBase]: For 60261/61495 co-relation queries the response was YES. [2025-01-10 06:56:52,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64779 conditions, 17998 events. 10409/17998 cut-off events. For 60261/61495 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 136957 event pairs, 4184 based on Foata normal form. 390/17445 useless extension candidates. Maximal degree in co-relation 64549. Up to 10893 conditions per place. [2025-01-10 06:56:52,520 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 158 selfloop transitions, 18 changer transitions 0/213 dead transitions. [2025-01-10 06:56:52,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 213 transitions, 1805 flow [2025-01-10 06:56:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:56:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:56:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2025-01-10 06:56:52,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2025-01-10 06:56:52,521 INFO L175 Difference]: Start difference. First operand has 191 places, 165 transitions, 1119 flow. Second operand 5 states and 312 transitions. [2025-01-10 06:56:52,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 213 transitions, 1805 flow [2025-01-10 06:56:52,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 213 transitions, 1760 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-10 06:56:52,572 INFO L231 Difference]: Finished difference. Result has 195 places, 171 transitions, 1187 flow [2025-01-10 06:56:52,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1187, PETRI_PLACES=195, PETRI_TRANSITIONS=171} [2025-01-10 06:56:52,573 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 95 predicate places. [2025-01-10 06:56:52,573 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 171 transitions, 1187 flow [2025-01-10 06:56:52,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:52,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:52,573 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:52,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:56:52,574 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:52,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1900250533, now seen corresponding path program 1 times [2025-01-10 06:56:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:52,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140503014] [2025-01-10 06:56:52,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:52,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:52,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:52,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:52,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:56:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140503014] [2025-01-10 06:56:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140503014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:56:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470142105] [2025-01-10 06:56:52,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:56:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:56:52,824 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:56:52,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 06:56:52,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:52,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:52,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:52,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:52,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:56:52,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:56:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:56:53,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:56:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470142105] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:53,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-01-10 06:56:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349934580] [2025-01-10 06:56:53,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:53,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 06:56:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:53,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 06:56:53,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-01-10 06:56:53,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 105 [2025-01-10 06:56:53,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 171 transitions, 1187 flow. Second operand has 26 states, 26 states have (on average 46.84615384615385) internal successors, (1218), 26 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:53,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:53,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 105 [2025-01-10 06:56:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:56:57,969 INFO L124 PetriNetUnfolderBase]: 19572/32466 cut-off events. [2025-01-10 06:56:57,969 INFO L125 PetriNetUnfolderBase]: For 88604/90296 co-relation queries the response was YES. [2025-01-10 06:56:58,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106009 conditions, 32466 events. 19572/32466 cut-off events. For 88604/90296 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 243939 event pairs, 11464 based on Foata normal form. 826/31728 useless extension candidates. Maximal degree in co-relation 105726. Up to 17166 conditions per place. [2025-01-10 06:56:58,182 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 211 selfloop transitions, 86 changer transitions 0/338 dead transitions. [2025-01-10 06:56:58,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 338 transitions, 2762 flow [2025-01-10 06:56:58,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:56:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:56:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1068 transitions. [2025-01-10 06:56:58,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2025-01-10 06:56:58,183 INFO L175 Difference]: Start difference. First operand has 195 places, 171 transitions, 1187 flow. Second operand 20 states and 1068 transitions. [2025-01-10 06:56:58,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 338 transitions, 2762 flow [2025-01-10 06:56:58,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 338 transitions, 2753 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:56:58,285 INFO L231 Difference]: Finished difference. Result has 219 places, 204 transitions, 1755 flow [2025-01-10 06:56:58,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1755, PETRI_PLACES=219, PETRI_TRANSITIONS=204} [2025-01-10 06:56:58,286 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 119 predicate places. [2025-01-10 06:56:58,286 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 204 transitions, 1755 flow [2025-01-10 06:56:58,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 46.84615384615385) internal successors, (1218), 26 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:58,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:56:58,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:56:58,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 06:56:58,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 06:56:58,488 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:56:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:56:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash -720364783, now seen corresponding path program 1 times [2025-01-10 06:56:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:56:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716539696] [2025-01-10 06:56:58,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:56:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:56:58,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:56:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:56:58,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:56:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:56:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:56:58,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:56:58,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716539696] [2025-01-10 06:56:58,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716539696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:56:58,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:56:58,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:56:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417465964] [2025-01-10 06:56:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:56:58,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:56:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:58,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:56:58,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:56:58,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-01-10 06:56:58,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 204 transitions, 1755 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:58,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:58,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-01-10 06:56:58,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:03,840 INFO L124 PetriNetUnfolderBase]: 25072/43315 cut-off events. [2025-01-10 06:57:03,840 INFO L125 PetriNetUnfolderBase]: For 180821/184208 co-relation queries the response was YES. [2025-01-10 06:57:04,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159544 conditions, 43315 events. 25072/43315 cut-off events. For 180821/184208 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 364976 event pairs, 19402 based on Foata normal form. 1202/42448 useless extension candidates. Maximal degree in co-relation 159052. Up to 19257 conditions per place. [2025-01-10 06:57:04,200 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 207 selfloop transitions, 31 changer transitions 0/275 dead transitions. [2025-01-10 06:57:04,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 275 transitions, 2766 flow [2025-01-10 06:57:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:57:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:57:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 395 transitions. [2025-01-10 06:57:04,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2025-01-10 06:57:04,201 INFO L175 Difference]: Start difference. First operand has 219 places, 204 transitions, 1755 flow. Second operand 7 states and 395 transitions. [2025-01-10 06:57:04,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 275 transitions, 2766 flow [2025-01-10 06:57:04,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 275 transitions, 2681 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:04,563 INFO L231 Difference]: Finished difference. Result has 226 places, 214 transitions, 1851 flow [2025-01-10 06:57:04,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1851, PETRI_PLACES=226, PETRI_TRANSITIONS=214} [2025-01-10 06:57:04,566 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 126 predicate places. [2025-01-10 06:57:04,567 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 214 transitions, 1851 flow [2025-01-10 06:57:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:04,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:04,567 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:57:04,567 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:57:04,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash -820672626, now seen corresponding path program 1 times [2025-01-10 06:57:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:04,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106757692] [2025-01-10 06:57:04,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:04,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:57:04,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:57:04,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:04,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:57:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106757692] [2025-01-10 06:57:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106757692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:04,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449379927] [2025-01-10 06:57:04,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:04,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:04,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:04,712 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:57:04,716 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:57:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:57:04,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:57:04,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:04,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:04,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:57:04,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:57:04,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:57:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449379927] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:04,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 06:57:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361690138] [2025-01-10 06:57:04,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:04,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:57:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:04,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:57:04,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:57:05,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-01-10 06:57:05,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 214 transitions, 1851 flow. Second operand has 15 states, 15 states have (on average 50.333333333333336) internal successors, (755), 15 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:05,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:05,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-01-10 06:57:05,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:11,766 INFO L124 PetriNetUnfolderBase]: 29336/48978 cut-off events. [2025-01-10 06:57:11,766 INFO L125 PetriNetUnfolderBase]: For 210305/213806 co-relation queries the response was YES. [2025-01-10 06:57:12,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175919 conditions, 48978 events. 29336/48978 cut-off events. For 210305/213806 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 398894 event pairs, 17296 based on Foata normal form. 1267/45942 useless extension candidates. Maximal degree in co-relation 175550. Up to 30405 conditions per place. [2025-01-10 06:57:12,351 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 177 selfloop transitions, 71 changer transitions 0/298 dead transitions. [2025-01-10 06:57:12,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 298 transitions, 3011 flow [2025-01-10 06:57:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:57:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:57:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 695 transitions. [2025-01-10 06:57:12,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2025-01-10 06:57:12,353 INFO L175 Difference]: Start difference. First operand has 226 places, 214 transitions, 1851 flow. Second operand 12 states and 695 transitions. [2025-01-10 06:57:12,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 298 transitions, 3011 flow [2025-01-10 06:57:12,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 298 transitions, 3003 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:12,771 INFO L231 Difference]: Finished difference. Result has 239 places, 216 transitions, 2051 flow [2025-01-10 06:57:12,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2051, PETRI_PLACES=239, PETRI_TRANSITIONS=216} [2025-01-10 06:57:12,772 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 139 predicate places. [2025-01-10 06:57:12,772 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 216 transitions, 2051 flow [2025-01-10 06:57:12,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.333333333333336) internal successors, (755), 15 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:12,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:12,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:12,780 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:57:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:12,977 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:57:12,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1390338325, now seen corresponding path program 1 times [2025-01-10 06:57:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393549502] [2025-01-10 06:57:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:12,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:57:12,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:57:12,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:12,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:57:13,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393549502] [2025-01-10 06:57:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393549502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093419979] [2025-01-10 06:57:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:13,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:13,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:13,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-01-10 06:57:13,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 216 transitions, 2051 flow. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:13,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:13,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-01-10 06:57:13,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:18,879 INFO L124 PetriNetUnfolderBase]: 24281/42630 cut-off events. [2025-01-10 06:57:18,880 INFO L125 PetriNetUnfolderBase]: For 177143/180320 co-relation queries the response was YES. [2025-01-10 06:57:19,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158323 conditions, 42630 events. 24281/42630 cut-off events. For 177143/180320 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 366549 event pairs, 18544 based on Foata normal form. 1188/41605 useless extension candidates. Maximal degree in co-relation 157927. Up to 26106 conditions per place. [2025-01-10 06:57:19,486 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 191 selfloop transitions, 29 changer transitions 0/267 dead transitions. [2025-01-10 06:57:19,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 267 transitions, 2937 flow [2025-01-10 06:57:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 330 transitions. [2025-01-10 06:57:19,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-10 06:57:19,488 INFO L175 Difference]: Start difference. First operand has 239 places, 216 transitions, 2051 flow. Second operand 5 states and 330 transitions. [2025-01-10 06:57:19,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 267 transitions, 2937 flow [2025-01-10 06:57:19,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 267 transitions, 2848 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:57:19,895 INFO L231 Difference]: Finished difference. Result has 239 places, 221 transitions, 2120 flow [2025-01-10 06:57:19,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2120, PETRI_PLACES=239, PETRI_TRANSITIONS=221} [2025-01-10 06:57:19,896 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 139 predicate places. [2025-01-10 06:57:19,896 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 221 transitions, 2120 flow [2025-01-10 06:57:19,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:19,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:19,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:57:19,896 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:57:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -35305398, now seen corresponding path program 1 times [2025-01-10 06:57:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-01-10 06:57:19,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:19,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:57:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:57:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:57:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:20,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-01-10 06:57:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072159083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:57:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016461498] [2025-01-10 06:57:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:20,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:57:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:57:20,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:57:20,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2025-01-10 06:57:20,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 221 transitions, 2120 flow. Second operand has 9 states, 9 states have (on average 37.111111111111114) internal successors, (334), 9 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:20,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:20,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2025-01-10 06:57:20,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:26,722 INFO L124 PetriNetUnfolderBase]: 24315/42419 cut-off events. [2025-01-10 06:57:26,722 INFO L125 PetriNetUnfolderBase]: For 183844/187367 co-relation queries the response was YES. [2025-01-10 06:57:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158513 conditions, 42419 events. 24315/42419 cut-off events. For 183844/187367 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 364402 event pairs, 12589 based on Foata normal form. 1240/41692 useless extension candidates. Maximal degree in co-relation 158056. Up to 26106 conditions per place. [2025-01-10 06:57:27,145 INFO L140 encePairwiseOnDemand]: 86/105 looper letters, 196 selfloop transitions, 53 changer transitions 5/280 dead transitions. [2025-01-10 06:57:27,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 280 transitions, 3109 flow [2025-01-10 06:57:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:57:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:57:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 578 transitions. [2025-01-10 06:57:27,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39319727891156464 [2025-01-10 06:57:27,146 INFO L175 Difference]: Start difference. First operand has 239 places, 221 transitions, 2120 flow. Second operand 14 states and 578 transitions. [2025-01-10 06:57:27,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 280 transitions, 3109 flow [2025-01-10 06:57:27,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 280 transitions, 3109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:57:27,426 INFO L231 Difference]: Finished difference. Result has 257 places, 230 transitions, 2337 flow [2025-01-10 06:57:27,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2337, PETRI_PLACES=257, PETRI_TRANSITIONS=230} [2025-01-10 06:57:27,427 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 157 predicate places. [2025-01-10 06:57:27,427 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 230 transitions, 2337 flow [2025-01-10 06:57:27,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.111111111111114) internal successors, (334), 9 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:27,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:27,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:27,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 06:57:27,428 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-01-10 06:57:27,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1793212179, now seen corresponding path program 1 times [2025-01-10 06:57:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-01-10 06:57:27,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:27,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 06:57:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:57:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:57:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-01-10 06:57:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136880358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167239274] [2025-01-10 06:57:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:27,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:27,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:27,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:27,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 105 [2025-01-10 06:57:27,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 230 transitions, 2337 flow. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:27,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:27,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 105 [2025-01-10 06:57:27,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand