./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.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-bad-dot-product-alt.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 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:52:47,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:52:47,322 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:52:47,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:52:47,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:52:47,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:52:47,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:52:47,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:52:47,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:52:47,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:52:47,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:52:47,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:52:47,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:52:47,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:52:47,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:52:47,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:47,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:47,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:52:47,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:52:47,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:52:47,381 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 -> 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 [2025-01-10 06:52:47,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:52:47,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:52:47,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:52:47,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:52:47,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:52:47,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c [2025-01-10 06:52:48,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e7f7012e/21d506cf47134367982a60dd8b79cd4d/FLAG9edb5a6e8 [2025-01-10 06:52:49,240 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:52:49,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c [2025-01-10 06:52:49,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e7f7012e/21d506cf47134367982a60dd8b79cd4d/FLAG9edb5a6e8 [2025-01-10 06:52:49,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e7f7012e/21d506cf47134367982a60dd8b79cd4d [2025-01-10 06:52:49,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:52:49,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:52:49,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:49,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:52:49,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:52:49,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507a8fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49, skipping insertion in model container [2025-01-10 06:52:49,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:52:49,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:49,632 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:52:49,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:49,669 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:52:49,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49 WrapperNode [2025-01-10 06:52:49,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:49,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:49,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:52:49,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:52:49,675 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:52:49" (1/1) ... [2025-01-10 06:52:49,682 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:52:49" (1/1) ... [2025-01-10 06:52:49,703 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 19, calls inlined = 27, statements flattened = 397 [2025-01-10 06:52:49,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:49,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:52:49,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:52:49,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:52:49,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,731 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 4, 24]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 1, 3]. [2025-01-10 06:52:49,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:52:49,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:52:49,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:52:49,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:52:49,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (1/1) ... [2025-01-10 06:52:49,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:49,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:49,804 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:52:49,807 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:52:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:52:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:52:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:52:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:52:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:52:49,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:52:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:52:49,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:52:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:52:49,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:52:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:52:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:52:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:52:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:52:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:52:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:52:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:52:49,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:52:49,832 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:52:49,944 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:52:49,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:52:50,417 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:52:50,417 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:52:50,895 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:52:50,896 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:52:50,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:50 BoogieIcfgContainer [2025-01-10 06:52:50,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:52:50,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:52:50,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:52:50,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:52:50,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:52:49" (1/3) ... [2025-01-10 06:52:50,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b432e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:50, skipping insertion in model container [2025-01-10 06:52:50,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:49" (2/3) ... [2025-01-10 06:52:50,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b432e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:50, skipping insertion in model container [2025-01-10 06:52:50,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:50" (3/3) ... [2025-01-10 06:52:50,905 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2025-01-10 06:52:50,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:52:50,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-dot-product-alt.wvr.c that has 4 procedures, 77 locations, 1 initial locations, 7 loop locations, and 32 error locations. [2025-01-10 06:52:50,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:52:51,096 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:52:51,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 83 transitions, 187 flow [2025-01-10 06:52:51,161 INFO L124 PetriNetUnfolderBase]: 7/80 cut-off events. [2025-01-10 06:52:51,163 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:52:51,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 80 events. 7/80 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 279 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-01-10 06:52:51,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 83 transitions, 187 flow [2025-01-10 06:52:51,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 78 transitions, 171 flow [2025-01-10 06:52:51,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:52:51,181 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;@31b2b40c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:52:51,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-10 06:52:51,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:52:51,184 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:52:51,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:52:51,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:51,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:52:51,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1326501, now seen corresponding path program 1 times [2025-01-10 06:52:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417568640] [2025-01-10 06:52:51,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:51,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:52:51,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:52:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:51,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:51,407 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:52:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417568640] [2025-01-10 06:52:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417568640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3293607] [2025-01-10 06:52:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:51,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:51,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:51,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 83 [2025-01-10 06:52:51,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:52:51,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:51,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 83 [2025-01-10 06:52:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:52,877 INFO L124 PetriNetUnfolderBase]: 4166/6692 cut-off events. [2025-01-10 06:52:52,878 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-01-10 06:52:52,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12884 conditions, 6692 events. 4166/6692 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 41337 event pairs, 3616 based on Foata normal form. 3/3715 useless extension candidates. Maximal degree in co-relation 12198. Up to 5909 conditions per place. [2025-01-10 06:52:52,931 INFO L140 encePairwiseOnDemand]: 60/83 looper letters, 52 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-01-10 06:52:52,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 81 transitions, 303 flow [2025-01-10 06:52:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-01-10 06:52:52,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4789156626506024 [2025-01-10 06:52:52,944 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 171 flow. Second operand 4 states and 159 transitions. [2025-01-10 06:52:52,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 81 transitions, 303 flow [2025-01-10 06:52:52,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:52,968 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 242 flow [2025-01-10 06:52:52,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2025-01-10 06:52:52,972 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -5 predicate places. [2025-01-10 06:52:52,973 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 242 flow [2025-01-10 06:52:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:52:52,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:52,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:52:52,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:52:52,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:52,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash 864414050, now seen corresponding path program 1 times [2025-01-10 06:52:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:52,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894701081] [2025-01-10 06:52:53,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:53,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:53,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:53,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:53,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894701081] [2025-01-10 06:52:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894701081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334859173] [2025-01-10 06:52:53,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:53,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:53,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:53,153 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:52:53,154 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:52:53,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:53,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:53,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:53,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:53,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:53,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:53,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334859173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:52:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656665703] [2025-01-10 06:52:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:52:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:52:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:52:53,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 83 [2025-01-10 06:52:53,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:52:53,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:53,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 83 [2025-01-10 06:52:53,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:54,419 INFO L124 PetriNetUnfolderBase]: 4166/6689 cut-off events. [2025-01-10 06:52:54,420 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-10 06:52:54,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12812 conditions, 6689 events. 4166/6689 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 41338 event pairs, 3616 based on Foata normal form. 3/3717 useless extension candidates. Maximal degree in co-relation 12740. Up to 5894 conditions per place. [2025-01-10 06:52:54,454 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 41 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2025-01-10 06:52:54,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 350 flow [2025-01-10 06:52:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:52:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:52:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-01-10 06:52:54,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3795180722891566 [2025-01-10 06:52:54,456 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 242 flow. Second operand 6 states and 189 transitions. [2025-01-10 06:52:54,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 350 flow [2025-01-10 06:52:54,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:52:54,458 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 268 flow [2025-01-10 06:52:54,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2025-01-10 06:52:54,459 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-01-10 06:52:54,459 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 268 flow [2025-01-10 06:52:54,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:52:54,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:54,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:52:54,467 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:52:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:54,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 865376732, now seen corresponding path program 1 times [2025-01-10 06:52:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927396079] [2025-01-10 06:52:54,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:54,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:54,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:54,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:54,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:54,797 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:52:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927396079] [2025-01-10 06:52:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927396079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479495170] [2025-01-10 06:52:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:54,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:54,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:54,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:54,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-01-10 06:52:54,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:52:54,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:54,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-01-10 06:52:54,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:55,506 INFO L124 PetriNetUnfolderBase]: 4169/6702 cut-off events. [2025-01-10 06:52:55,507 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-01-10 06:52:55,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12872 conditions, 6702 events. 4169/6702 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 41480 event pairs, 3616 based on Foata normal form. 1/3730 useless extension candidates. Maximal degree in co-relation 12761. Up to 5912 conditions per place. [2025-01-10 06:52:55,538 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 62 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-01-10 06:52:55,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 458 flow [2025-01-10 06:52:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-01-10 06:52:55,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4759036144578313 [2025-01-10 06:52:55,540 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 268 flow. Second operand 4 states and 158 transitions. [2025-01-10 06:52:55,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 458 flow [2025-01-10 06:52:55,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 394 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:55,545 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 265 flow [2025-01-10 06:52:55,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2025-01-10 06:52:55,546 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-01-10 06:52:55,546 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 265 flow [2025-01-10 06:52:55,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:52:55,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:55,547 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:52:55,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:52:55,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:55,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1027033113, now seen corresponding path program 1 times [2025-01-10 06:52:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148700024] [2025-01-10 06:52:55,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:55,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:52:55,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:52:55,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:55,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:55,663 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:52:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148700024] [2025-01-10 06:52:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148700024] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954999491] [2025-01-10 06:52:55,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:55,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:55,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:55,669 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:52:55,670 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:52:55,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:52:55,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:52:55,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:55,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:55,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:55,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:55,801 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:52:55,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:52:55,833 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:52:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954999491] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:52:55,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:52:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:52:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770348616] [2025-01-10 06:52:55,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:52:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:52:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:55,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:52:55,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:52:55,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 83 [2025-01-10 06:52:55,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 265 flow. Second operand has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 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:52:55,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:55,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 83 [2025-01-10 06:52:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:56,872 INFO L124 PetriNetUnfolderBase]: 4181/6750 cut-off events. [2025-01-10 06:52:56,872 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-01-10 06:52:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12993 conditions, 6750 events. 4181/6750 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 42020 event pairs, 3616 based on Foata normal form. 12/3789 useless extension candidates. Maximal degree in co-relation 12889. Up to 5923 conditions per place. [2025-01-10 06:52:56,902 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 52 selfloop transitions, 42 changer transitions 0/112 dead transitions. [2025-01-10 06:52:56,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 612 flow [2025-01-10 06:52:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:52:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:52:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 306 transitions. [2025-01-10 06:52:56,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3686746987951807 [2025-01-10 06:52:56,905 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 265 flow. Second operand 10 states and 306 transitions. [2025-01-10 06:52:56,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 612 flow [2025-01-10 06:52:56,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 112 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:56,907 INFO L231 Difference]: Finished difference. Result has 89 places, 112 transitions, 555 flow [2025-01-10 06:52:56,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=555, PETRI_PLACES=89, PETRI_TRANSITIONS=112} [2025-01-10 06:52:56,908 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 8 predicate places. [2025-01-10 06:52:56,908 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 112 transitions, 555 flow [2025-01-10 06:52:56,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 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:52:56,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:56,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:56,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:52:57,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:57,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1594709707, now seen corresponding path program 1 times [2025-01-10 06:52:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90752128] [2025-01-10 06:52:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:57,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:52:57,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:52:57,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:57,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:57,267 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:52:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90752128] [2025-01-10 06:52:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90752128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:52:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322472806] [2025-01-10 06:52:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:57,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:57,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-01-10 06:52:57,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 112 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:52:57,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:57,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-01-10 06:52:57,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:58,306 INFO L124 PetriNetUnfolderBase]: 6567/10600 cut-off events. [2025-01-10 06:52:58,306 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-01-10 06:52:58,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20407 conditions, 10600 events. 6567/10600 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 70515 event pairs, 2401 based on Foata normal form. 0/5942 useless extension candidates. Maximal degree in co-relation 20276. Up to 5444 conditions per place. [2025-01-10 06:52:58,350 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 119 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-01-10 06:52:58,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 142 transitions, 862 flow [2025-01-10 06:52:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 06:52:58,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6465863453815262 [2025-01-10 06:52:58,353 INFO L175 Difference]: Start difference. First operand has 89 places, 112 transitions, 555 flow. Second operand 3 states and 161 transitions. [2025-01-10 06:52:58,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 142 transitions, 862 flow [2025-01-10 06:52:58,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 142 transitions, 826 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:58,359 INFO L231 Difference]: Finished difference. Result has 90 places, 113 transitions, 533 flow [2025-01-10 06:52:58,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=90, PETRI_TRANSITIONS=113} [2025-01-10 06:52:58,360 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2025-01-10 06:52:58,360 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 113 transitions, 533 flow [2025-01-10 06:52:58,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:52:58,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:58,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:58,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:52:58,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:58,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1594709711, now seen corresponding path program 1 times [2025-01-10 06:52:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037067564] [2025-01-10 06:52:58,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:58,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:52:58,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:52:58,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:58,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:58,469 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:52:58,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037067564] [2025-01-10 06:52:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037067564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:58,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:58,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049383676] [2025-01-10 06:52:58,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:58,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:58,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:58,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-01-10 06:52:58,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 113 transitions, 533 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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:52:58,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:58,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-01-10 06:52:58,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:59,427 INFO L124 PetriNetUnfolderBase]: 6577/10439 cut-off events. [2025-01-10 06:52:59,429 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2025-01-10 06:52:59,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21262 conditions, 10439 events. 6577/10439 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 65778 event pairs, 5793 based on Foata normal form. 3/6110 useless extension candidates. Maximal degree in co-relation 21075. Up to 9332 conditions per place. [2025-01-10 06:52:59,465 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 106 selfloop transitions, 10 changer transitions 0/137 dead transitions. [2025-01-10 06:52:59,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 933 flow [2025-01-10 06:52:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:52:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:52:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2025-01-10 06:52:59,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4746987951807229 [2025-01-10 06:52:59,470 INFO L175 Difference]: Start difference. First operand has 90 places, 113 transitions, 533 flow. Second operand 5 states and 197 transitions. [2025-01-10 06:52:59,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 933 flow [2025-01-10 06:52:59,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 137 transitions, 931 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:59,474 INFO L231 Difference]: Finished difference. Result has 95 places, 114 transitions, 568 flow [2025-01-10 06:52:59,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=95, PETRI_TRANSITIONS=114} [2025-01-10 06:52:59,475 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 14 predicate places. [2025-01-10 06:52:59,476 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 114 transitions, 568 flow [2025-01-10 06:52:59,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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:52:59,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:59,477 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:52:59,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:52:59,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1003187941, now seen corresponding path program 1 times [2025-01-10 06:52:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95244850] [2025-01-10 06:52:59,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:59,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:52:59,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:52:59,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:59,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:59,567 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:52:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:59,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95244850] [2025-01-10 06:52:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95244850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:59,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070285706] [2025-01-10 06:52:59,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:59,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:59,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:59,571 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:52:59,573 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:52:59,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:52:59,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:52:59,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:59,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:59,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:59,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:59,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070285706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:52:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308910127] [2025-01-10 06:52:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:52:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:52:59,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:52:59,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-01-10 06:52:59,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 114 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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:52:59,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:59,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-01-10 06:52:59,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:01,113 INFO L124 PetriNetUnfolderBase]: 6577/10437 cut-off events. [2025-01-10 06:53:01,114 INFO L125 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2025-01-10 06:53:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21094 conditions, 10437 events. 6577/10437 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 65730 event pairs, 5793 based on Foata normal form. 2/6106 useless extension candidates. Maximal degree in co-relation 20904. Up to 9302 conditions per place. [2025-01-10 06:53:01,211 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 85 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2025-01-10 06:53:01,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 124 transitions, 847 flow [2025-01-10 06:53:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:53:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:53:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-01-10 06:53:01,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41365461847389556 [2025-01-10 06:53:01,214 INFO L175 Difference]: Start difference. First operand has 95 places, 114 transitions, 568 flow. Second operand 6 states and 206 transitions. [2025-01-10 06:53:01,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 124 transitions, 847 flow [2025-01-10 06:53:01,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 124 transitions, 845 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:01,220 INFO L231 Difference]: Finished difference. Result has 99 places, 113 transitions, 602 flow [2025-01-10 06:53:01,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=602, PETRI_PLACES=99, PETRI_TRANSITIONS=113} [2025-01-10 06:53:01,221 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 18 predicate places. [2025-01-10 06:53:01,221 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 113 transitions, 602 flow [2025-01-10 06:53:01,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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:53:01,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:01,222 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:53:01,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:53:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:01,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:53:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1034053752, now seen corresponding path program 1 times [2025-01-10 06:53:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846507415] [2025-01-10 06:53:01,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:01,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:53:01,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:53:01,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:01,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846507415] [2025-01-10 06:53:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846507415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461943085] [2025-01-10 06:53:01,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:01,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:01,538 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:53:01,540 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:53:01,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:53:01,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:53:01,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:01,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:01,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:53:01,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:01,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461943085] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:01,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:53:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209633680] [2025-01-10 06:53:01,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:01,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:53:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:01,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:53:01,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:53:01,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-01-10 06:53:01,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 113 transitions, 602 flow. Second operand has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 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:53:01,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:01,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-01-10 06:53:01,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:02,791 INFO L124 PetriNetUnfolderBase]: 6610/10584 cut-off events. [2025-01-10 06:53:02,791 INFO L125 PetriNetUnfolderBase]: For 909/909 co-relation queries the response was YES. [2025-01-10 06:53:02,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21669 conditions, 10584 events. 6610/10584 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 67508 event pairs, 5793 based on Foata normal form. 6/6259 useless extension candidates. Maximal degree in co-relation 21293. Up to 9343 conditions per place. [2025-01-10 06:53:02,845 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 125 selfloop transitions, 34 changer transitions 0/178 dead transitions. [2025-01-10 06:53:02,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 178 transitions, 1389 flow [2025-01-10 06:53:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:53:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:53:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 326 transitions. [2025-01-10 06:53:02,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3927710843373494 [2025-01-10 06:53:02,848 INFO L175 Difference]: Start difference. First operand has 99 places, 113 transitions, 602 flow. Second operand 10 states and 326 transitions. [2025-01-10 06:53:02,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 178 transitions, 1389 flow [2025-01-10 06:53:02,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 178 transitions, 1276 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-01-10 06:53:02,854 INFO L231 Difference]: Finished difference. Result has 106 places, 134 transitions, 780 flow [2025-01-10 06:53:02,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=780, PETRI_PLACES=106, PETRI_TRANSITIONS=134} [2025-01-10 06:53:02,858 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 25 predicate places. [2025-01-10 06:53:02,858 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 134 transitions, 780 flow [2025-01-10 06:53:02,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 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:53:02,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:02,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:02,864 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:53:03,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:53:03,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:53:03,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1105028189, now seen corresponding path program 1 times [2025-01-10 06:53:03,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:03,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748316624] [2025-01-10 06:53:03,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:03,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:53:03,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:53:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:53:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748316624] [2025-01-10 06:53:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748316624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:53:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355626170] [2025-01-10 06:53:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:03,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:03,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:03,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:03,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-01-10 06:53:03,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 134 transitions, 780 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:53:03,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:03,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-01-10 06:53:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:04,519 INFO L124 PetriNetUnfolderBase]: 6733/10798 cut-off events. [2025-01-10 06:53:04,519 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES. [2025-01-10 06:53:04,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22111 conditions, 10798 events. 6733/10798 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 68572 event pairs, 5917 based on Foata normal form. 0/6467 useless extension candidates. Maximal degree in co-relation 21841. Up to 9416 conditions per place. [2025-01-10 06:53:04,607 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 116 selfloop transitions, 8 changer transitions 15/159 dead transitions. [2025-01-10 06:53:04,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 159 transitions, 1163 flow [2025-01-10 06:53:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-01-10 06:53:04,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391566265060241 [2025-01-10 06:53:04,610 INFO L175 Difference]: Start difference. First operand has 106 places, 134 transitions, 780 flow. Second operand 4 states and 179 transitions. [2025-01-10 06:53:04,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 159 transitions, 1163 flow [2025-01-10 06:53:04,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 159 transitions, 1139 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:04,617 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 779 flow [2025-01-10 06:53:04,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=108, PETRI_TRANSITIONS=133} [2025-01-10 06:53:04,619 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 27 predicate places. [2025-01-10 06:53:04,619 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 779 flow [2025-01-10 06:53:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:53:04,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:04,619 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:53:04,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:53:04,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:53:04,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash 609797750, now seen corresponding path program 2 times [2025-01-10 06:53:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556645563] [2025-01-10 06:53:04,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:53:04,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:04,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:53:04,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:53:04,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:53:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:04,689 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:53:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556645563] [2025-01-10 06:53:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556645563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487981359] [2025-01-10 06:53:04,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:53:04,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:04,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:04,693 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:53:04,695 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:53:04,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:53:04,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:53:04,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:53:04,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:53:04,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:04,813 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:53:04,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:04,832 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:53:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487981359] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:04,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:53:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066754826] [2025-01-10 06:53:04,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:04,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:04,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:04,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:04,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 83 [2025-01-10 06:53:04,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 779 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:53:04,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:04,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 83 [2025-01-10 06:53:04,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:05,817 INFO L124 PetriNetUnfolderBase]: 6609/10582 cut-off events. [2025-01-10 06:53:05,817 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2025-01-10 06:53:05,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22592 conditions, 10582 events. 6609/10582 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 67323 event pairs, 5793 based on Foata normal form. 1/7186 useless extension candidates. Maximal degree in co-relation 22320. Up to 9480 conditions per place. [2025-01-10 06:53:05,880 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 99 selfloop transitions, 16 changer transitions 0/132 dead transitions. [2025-01-10 06:53:05,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 999 flow [2025-01-10 06:53:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-01-10 06:53:05,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4066265060240964 [2025-01-10 06:53:05,881 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 779 flow. Second operand 4 states and 135 transitions. [2025-01-10 06:53:05,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 999 flow [2025-01-10 06:53:05,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 132 transitions, 983 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:05,887 INFO L231 Difference]: Finished difference. Result has 107 places, 132 transitions, 785 flow [2025-01-10 06:53:05,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=785, PETRI_PLACES=107, PETRI_TRANSITIONS=132} [2025-01-10 06:53:05,887 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 26 predicate places. [2025-01-10 06:53:05,887 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 785 flow [2025-01-10 06:53:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:53:05,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:05,888 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:53:05,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:53:06,088 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:53:06,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:53:06,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash -218951204, now seen corresponding path program 1 times [2025-01-10 06:53:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:06,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625973763] [2025-01-10 06:53:06,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:06,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:06,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:53:06,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:53:06,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:06,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:53:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:06,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625973763] [2025-01-10 06:53:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625973763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:06,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:06,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:53:06,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268195267] [2025-01-10 06:53:06,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:06,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:06,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:06,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:06,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:06,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-01-10 06:53:06,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 132 transitions, 785 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:53:06,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:06,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-01-10 06:53:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:07,479 INFO L124 PetriNetUnfolderBase]: 6776/10998 cut-off events. [2025-01-10 06:53:07,479 INFO L125 PetriNetUnfolderBase]: For 2053/2053 co-relation queries the response was YES. [2025-01-10 06:53:07,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23780 conditions, 10998 events. 6776/10998 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 70259 event pairs, 5917 based on Foata normal form. 75/7676 useless extension candidates. Maximal degree in co-relation 23258. Up to 9424 conditions per place. [2025-01-10 06:53:07,555 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 123 selfloop transitions, 26 changer transitions 18/186 dead transitions. [2025-01-10 06:53:07,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 186 transitions, 1478 flow [2025-01-10 06:53:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:53:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:53:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-01-10 06:53:07,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5253012048192771 [2025-01-10 06:53:07,560 INFO L175 Difference]: Start difference. First operand has 107 places, 132 transitions, 785 flow. Second operand 5 states and 218 transitions. [2025-01-10 06:53:07,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 186 transitions, 1478 flow [2025-01-10 06:53:07,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 186 transitions, 1446 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:07,574 INFO L231 Difference]: Finished difference. Result has 109 places, 138 transitions, 877 flow [2025-01-10 06:53:07,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=109, PETRI_TRANSITIONS=138} [2025-01-10 06:53:07,575 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 28 predicate places. [2025-01-10 06:53:07,575 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 138 transitions, 877 flow [2025-01-10 06:53:07,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:53:07,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:07,580 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-01-10 06:53:07,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:53:07,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:53:07,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1605659484, now seen corresponding path program 1 times [2025-01-10 06:53:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18310633] [2025-01-10 06:53:07,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:07,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:53:07,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:53:07,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:07,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18310633] [2025-01-10 06:53:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18310633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357666463] [2025-01-10 06:53:07,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:07,816 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:53:07,818 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:53:07,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:53:07,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:53:07,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:07,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:07,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:53:07,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:07,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:08,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357666463] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:08,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:08,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:53:08,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615855330] [2025-01-10 06:53:08,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:08,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:53:08,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:08,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:53:08,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:53:08,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 83 [2025-01-10 06:53:08,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 138 transitions, 877 flow. Second operand has 24 states, 24 states have (on average 22.166666666666668) internal successors, (532), 24 states have internal predecessors, (532), 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:53:08,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:08,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 83 [2025-01-10 06:53:08,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:09,527 INFO L124 PetriNetUnfolderBase]: 6896/11906 cut-off events. [2025-01-10 06:53:09,528 INFO L125 PetriNetUnfolderBase]: For 5886/5886 co-relation queries the response was YES. [2025-01-10 06:53:09,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27035 conditions, 11906 events. 6896/11906 cut-off events. For 5886/5886 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 81832 event pairs, 5917 based on Foata normal form. 114/8556 useless extension candidates. Maximal degree in co-relation 26010. Up to 9805 conditions per place. [2025-01-10 06:53:09,606 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 60 selfloop transitions, 139 changer transitions 0/216 dead transitions. [2025-01-10 06:53:09,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 216 transitions, 1935 flow [2025-01-10 06:53:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:53:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:53:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 614 transitions. [2025-01-10 06:53:09,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3362541073384447 [2025-01-10 06:53:09,613 INFO L175 Difference]: Start difference. First operand has 109 places, 138 transitions, 877 flow. Second operand 22 states and 614 transitions. [2025-01-10 06:53:09,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 216 transitions, 1935 flow [2025-01-10 06:53:09,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 216 transitions, 1935 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:09,623 INFO L231 Difference]: Finished difference. Result has 136 places, 216 transitions, 1899 flow [2025-01-10 06:53:09,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1899, PETRI_PLACES=136, PETRI_TRANSITIONS=216} [2025-01-10 06:53:09,625 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 55 predicate places. [2025-01-10 06:53:09,625 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 216 transitions, 1899 flow [2025-01-10 06:53:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 22.166666666666668) internal successors, (532), 24 states have internal predecessors, (532), 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:53:09,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:09,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:09,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:53:09,826 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,SelfDestructingSolverStorable11 [2025-01-10 06:53:09,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 56 more)] === [2025-01-10 06:53:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash -623952895, now seen corresponding path program 1 times [2025-01-10 06:53:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563510559] [2025-01-10 06:53:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:09,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:53:09,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:53:09,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:09,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:53:10,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563510559] [2025-01-10 06:53:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563510559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537864326] [2025-01-10 06:53:10,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:10,800 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:53:10,804 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:53:10,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:53:10,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:53:10,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:10,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:10,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 06:53:10,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:11,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 06:53:11,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 06:53:11,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 06:53:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:53:11,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:11,695 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 67 treesize of output 65 [2025-01-10 06:53:11,702 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 128 treesize of output 114 [2025-01-10 06:53:11,709 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 114 treesize of output 110 [2025-01-10 06:53:11,721 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 190 treesize of output 162 [2025-01-10 06:53:12,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:53:12,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 1114 treesize of output 1345 [2025-01-10 06:53:52,790 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 20 treesize of output 8 [2025-01-10 06:53:52,820 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 20 treesize of output 8 [2025-01-10 06:53:54,679 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 20 treesize of output 8 [2025-01-10 06:53:54,689 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 20 treesize of output 8 [2025-01-10 06:53:54,723 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 20 treesize of output 8 [2025-01-10 06:53:54,743 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 20 treesize of output 8 [2025-01-10 06:53:54,905 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 20 treesize of output 8 [2025-01-10 06:53:54,934 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 20 treesize of output 8 [2025-01-10 06:53:56,329 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 20 treesize of output 8 [2025-01-10 06:53:56,350 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 20 treesize of output 8