./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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-more-array-sum2.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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:52:51,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:52:52,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:52:52,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:52:52,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:52:52,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:52:52,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:52:52,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:52:52,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:52:52,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:52:52,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:52:52,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:52:52,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:52:52,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:52:52,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:52:52,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:52:52,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:52:52,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:52:52,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:52:52,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:52:52,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:52:52,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:52:52,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:52:52,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:52:52,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:52:52,087 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-02-06 18:52:52,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:52:52,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:52:52,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:52:52,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:52:52,403 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:52:52,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-06 18:52:53,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a213ef27/8097aaa49b7c49daba6b9eebb4e5579b/FLAG3e5696b5e [2025-02-06 18:52:53,982 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:52:53,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-06 18:52:53,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a213ef27/8097aaa49b7c49daba6b9eebb4e5579b/FLAG3e5696b5e [2025-02-06 18:52:54,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a213ef27/8097aaa49b7c49daba6b9eebb4e5579b [2025-02-06 18:52:54,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:52:54,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:52:54,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:52:54,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:52:54,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:52:54,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9a629e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54, skipping insertion in model container [2025-02-06 18:52:54,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:52:54,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:52:54,525 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:52:54,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:52:54,570 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:52:54,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54 WrapperNode [2025-02-06 18:52:54,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:52:54,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:52:54,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:52:54,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:52:54,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,619 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 345 [2025-02-06 18:52:54,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:52:54,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:52:54,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:52:54,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:52:54,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,663 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 18:52:54,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:52:54,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:52:54,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:52:54,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:52:54,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (1/1) ... [2025-02-06 18:52:54,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:52:54,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:52:54,724 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-02-06 18:52:54,726 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-02-06 18:52:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:52:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:52:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:52:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:52:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:52:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:52:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:52:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:52:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:52:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:52:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:52:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 18:52:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 18:52:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:52:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:52:54,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:52:54,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:52:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:52:54,752 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:52:54,850 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:52:54,851 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:52:55,374 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:52:55,374 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:52:55,980 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:52:55,981 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:52:55,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:52:55 BoogieIcfgContainer [2025-02-06 18:52:55,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:52:55,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:52:55,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:52:55,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:52:55,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:52:54" (1/3) ... [2025-02-06 18:52:55,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6bb53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:52:55, skipping insertion in model container [2025-02-06 18:52:55,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:52:54" (2/3) ... [2025-02-06 18:52:55,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6bb53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:52:55, skipping insertion in model container [2025-02-06 18:52:55,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:52:55" (3/3) ... [2025-02-06 18:52:55,991 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-02-06 18:52:56,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:52:56,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 85 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2025-02-06 18:52:56,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:52:56,290 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:52:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 199 flow [2025-02-06 18:52:56,389 INFO L124 PetriNetUnfolderBase]: 5/86 cut-off events. [2025-02-06 18:52:56,393 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:52:56,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 5/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 368 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-02-06 18:52:56,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 199 flow [2025-02-06 18:52:56,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 183 flow [2025-02-06 18:52:56,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:52:56,425 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;@b3eaaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:52:56,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2025-02-06 18:52:56,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:52:56,429 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 18:52:56,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:52:56,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:56,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:52:56,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:52:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1133455, now seen corresponding path program 1 times [2025-02-06 18:52:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129656244] [2025-02-06 18:52:56,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:56,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:52:56,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:52:56,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:56,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:56,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129656244] [2025-02-06 18:52:56,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129656244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:52:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:52:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:52:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480240361] [2025-02-06 18:52:56,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:52:56,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:52:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:56,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:52:56,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:52:56,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-02-06 18:52:56,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-02-06 18:52:56,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:56,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-02-06 18:52:56,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:58,650 INFO L124 PetriNetUnfolderBase]: 5633/9032 cut-off events. [2025-02-06 18:52:58,651 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-02-06 18:52:58,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17339 conditions, 9032 events. 5633/9032 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 68464 event pairs, 4968 based on Foata normal form. 2/4795 useless extension candidates. Maximal degree in co-relation 16560. Up to 7963 conditions per place. [2025-02-06 18:52:58,720 INFO L140 encePairwiseOnDemand]: 63/89 looper letters, 41 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-02-06 18:52:58,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 237 flow [2025-02-06 18:52:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:52:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:52:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-02-06 18:52:58,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41292134831460675 [2025-02-06 18:52:58,735 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 183 flow. Second operand 4 states and 147 transitions. [2025-02-06 18:52:58,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 237 flow [2025-02-06 18:52:58,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 228 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:52:58,750 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 146 flow [2025-02-06 18:52:58,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-02-06 18:52:58,756 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -22 predicate places. [2025-02-06 18:52:58,756 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 146 flow [2025-02-06 18:52:58,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-02-06 18:52:58,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:58,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:52:58,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:52:58,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:52:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 35138133, now seen corresponding path program 1 times [2025-02-06 18:52:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717980271] [2025-02-06 18:52:58,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:58,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:52:58,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:52:58,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:58,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:52:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717980271] [2025-02-06 18:52:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717980271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:52:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:52:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:52:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872377404] [2025-02-06 18:52:58,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:52:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:52:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:58,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:52:58,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:52:58,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-02-06 18:52:58,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-02-06 18:52:58,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:58,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-02-06 18:52:58,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:00,482 INFO L124 PetriNetUnfolderBase]: 5635/9040 cut-off events. [2025-02-06 18:53:00,482 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-02-06 18:53:00,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17241 conditions, 9040 events. 5635/9040 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 68570 event pairs, 4968 based on Foata normal form. 2/4805 useless extension candidates. Maximal degree in co-relation 17193. Up to 7972 conditions per place. [2025-02-06 18:53:00,606 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 46 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-02-06 18:53:00,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2025-02-06 18:53:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:53:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:53:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-02-06 18:53:00,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3792134831460674 [2025-02-06 18:53:00,609 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 4 states and 135 transitions. [2025-02-06 18:53:00,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2025-02-06 18:53:00,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:53:00,614 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 190 flow [2025-02-06 18:53:00,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-02-06 18:53:00,615 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -19 predicate places. [2025-02-06 18:53:00,616 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 190 flow [2025-02-06 18:53:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-02-06 18:53:00,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:00,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-06 18:53:00,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:53:00,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1170783210, now seen corresponding path program 1 times [2025-02-06 18:53:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175619550] [2025-02-06 18:53:00,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:00,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:53:00,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:53:00,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:00,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:00,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175619550] [2025-02-06 18:53:00,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175619550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:00,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379357245] [2025-02-06 18:53:00,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:00,760 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-02-06 18:53:00,763 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-02-06 18:53:00,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:53:00,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:53:00,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:00,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:00,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:53:00,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:00,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:00,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379357245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:00,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:00,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 18:53:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342964705] [2025-02-06 18:53:00,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:00,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:53:00,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:00,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:53:00,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:53:01,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-02-06 18:53:01,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 190 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:53:01,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:01,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-02-06 18:53:01,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:02,392 INFO L124 PetriNetUnfolderBase]: 5641/9064 cut-off events. [2025-02-06 18:53:02,392 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-02-06 18:53:02,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17317 conditions, 9064 events. 5641/9064 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 68917 event pairs, 4968 based on Foata normal form. 0/4823 useless extension candidates. Maximal degree in co-relation 17204. Up to 7975 conditions per place. [2025-02-06 18:53:02,435 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 46 selfloop transitions, 25 changer transitions 0/88 dead transitions. [2025-02-06 18:53:02,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 410 flow [2025-02-06 18:53:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:53:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:53:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 277 transitions. [2025-02-06 18:53:02,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3112359550561798 [2025-02-06 18:53:02,441 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 190 flow. Second operand 10 states and 277 transitions. [2025-02-06 18:53:02,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 410 flow [2025-02-06 18:53:02,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 88 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:53:02,444 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 352 flow [2025-02-06 18:53:02,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=352, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2025-02-06 18:53:02,445 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -7 predicate places. [2025-02-06 18:53:02,446 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 352 flow [2025-02-06 18:53:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:53:02,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:02,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:02,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:53:02,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:02,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:02,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1081519095, now seen corresponding path program 1 times [2025-02-06 18:53:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706136451] [2025-02-06 18:53:02,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:02,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:53:02,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:53:02,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:02,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:02,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706136451] [2025-02-06 18:53:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706136451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:53:02,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:53:02,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:53:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187872738] [2025-02-06 18:53:02,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:53:02,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:53:02,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:02,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:53:02,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:53:02,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:02,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-06 18:53:02,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:02,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:02,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:04,166 INFO L124 PetriNetUnfolderBase]: 5640/9079 cut-off events. [2025-02-06 18:53:04,166 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-02-06 18:53:04,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17411 conditions, 9079 events. 5640/9079 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 68849 event pairs, 4968 based on Foata normal form. 5/4848 useless extension candidates. Maximal degree in co-relation 17321. Up to 7984 conditions per place. [2025-02-06 18:53:04,225 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 61 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2025-02-06 18:53:04,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 97 transitions, 570 flow [2025-02-06 18:53:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:53:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:53:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-02-06 18:53:04,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3955056179775281 [2025-02-06 18:53:04,228 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 352 flow. Second operand 5 states and 176 transitions. [2025-02-06 18:53:04,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 97 transitions, 570 flow [2025-02-06 18:53:04,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 490 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-02-06 18:53:04,234 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 406 flow [2025-02-06 18:53:04,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2025-02-06 18:53:04,237 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -5 predicate places. [2025-02-06 18:53:04,237 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 406 flow [2025-02-06 18:53:04,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-06 18:53:04,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:04,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:53:04,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493601, now seen corresponding path program 1 times [2025-02-06 18:53:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813320422] [2025-02-06 18:53:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:04,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:04,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:04,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813320422] [2025-02-06 18:53:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813320422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274878245] [2025-02-06 18:53:04,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:04,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:04,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:04,776 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-02-06 18:53:04,778 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-02-06 18:53:04,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:04,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:04,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 18:53:04,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:04,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:53:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:05,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:05,097 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 16 treesize of output 14 [2025-02-06 18:53:05,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-06 18:53:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274878245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:05,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:05,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 18:53:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193505628] [2025-02-06 18:53:05,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:05,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:53:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:05,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:53:05,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:53:05,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:05,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 406 flow. Second operand has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 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-02-06 18:53:05,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:05,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:05,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:06,950 INFO L124 PetriNetUnfolderBase]: 9656/15708 cut-off events. [2025-02-06 18:53:06,951 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-02-06 18:53:06,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29757 conditions, 15708 events. 9656/15708 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 122453 event pairs, 2801 based on Foata normal form. 0/8316 useless extension candidates. Maximal degree in co-relation 29663. Up to 5348 conditions per place. [2025-02-06 18:53:07,044 INFO L140 encePairwiseOnDemand]: 72/89 looper letters, 111 selfloop transitions, 24 changer transitions 0/154 dead transitions. [2025-02-06 18:53:07,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 154 transitions, 798 flow [2025-02-06 18:53:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:53:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:53:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-02-06 18:53:07,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42275280898876405 [2025-02-06 18:53:07,046 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 406 flow. Second operand 8 states and 301 transitions. [2025-02-06 18:53:07,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 154 transitions, 798 flow [2025-02-06 18:53:07,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 154 transitions, 788 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:53:07,051 INFO L231 Difference]: Finished difference. Result has 92 places, 104 transitions, 493 flow [2025-02-06 18:53:07,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=493, PETRI_PLACES=92, PETRI_TRANSITIONS=104} [2025-02-06 18:53:07,051 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 3 predicate places. [2025-02-06 18:53:07,052 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 493 flow [2025-02-06 18:53:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 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-02-06 18:53:07,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:07,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:07,060 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-02-06 18:53:07,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:07,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493600, now seen corresponding path program 1 times [2025-02-06 18:53:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:07,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013624727] [2025-02-06 18:53:07,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:07,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:07,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:07,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:07,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:07,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:07,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013624727] [2025-02-06 18:53:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013624727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:07,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936459393] [2025-02-06 18:53:07,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:07,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:07,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:07,565 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-02-06 18:53:07,567 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-02-06 18:53:07,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:07,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:07,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:07,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:07,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:53:07,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:07,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:53:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:07,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:07,818 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 14 treesize of output 12 [2025-02-06 18:53:07,822 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 18 treesize of output 16 [2025-02-06 18:53:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936459393] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:07,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 18:53:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347952165] [2025-02-06 18:53:07,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:07,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:53:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:07,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:53:07,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:53:07,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:07,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 493 flow. Second operand has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 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-02-06 18:53:07,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:07,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:09,626 INFO L124 PetriNetUnfolderBase]: 9114/14832 cut-off events. [2025-02-06 18:53:09,626 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2025-02-06 18:53:09,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33880 conditions, 14832 events. 9114/14832 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 115362 event pairs, 2507 based on Foata normal form. 0/8164 useless extension candidates. Maximal degree in co-relation 33782. Up to 4584 conditions per place. [2025-02-06 18:53:09,692 INFO L140 encePairwiseOnDemand]: 72/89 looper letters, 110 selfloop transitions, 24 changer transitions 0/153 dead transitions. [2025-02-06 18:53:09,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 863 flow [2025-02-06 18:53:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:53:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:53:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-02-06 18:53:09,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42134831460674155 [2025-02-06 18:53:09,694 INFO L175 Difference]: Start difference. First operand has 92 places, 104 transitions, 493 flow. Second operand 8 states and 300 transitions. [2025-02-06 18:53:09,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 863 flow [2025-02-06 18:53:09,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 153 transitions, 850 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:53:09,700 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 524 flow [2025-02-06 18:53:09,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=524, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-02-06 18:53:09,701 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2025-02-06 18:53:09,701 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 524 flow [2025-02-06 18:53:09,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 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-02-06 18:53:09,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:09,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:09,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:53:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:09,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493598, now seen corresponding path program 1 times [2025-02-06 18:53:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457397555] [2025-02-06 18:53:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:09,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:09,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:09,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:09,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:10,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457397555] [2025-02-06 18:53:10,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457397555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:10,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939094702] [2025-02-06 18:53:10,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:10,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:10,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:10,330 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-02-06 18:53:10,331 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-02-06 18:53:10,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:10,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:10,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:10,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:10,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 18:53:10,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:10,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:53:10,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:53:10,523 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:53:10,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:53:10,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 18:53:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:10,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:10,650 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_78 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_78) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-02-06 18:53:10,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:10,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-06 18:53:10,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:10,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-02-06 18:53:10,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-06 18:53:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 18:53:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939094702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:10,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-02-06 18:53:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969465792] [2025-02-06 18:53:10,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 18:53:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:10,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 18:53:10,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-02-06 18:53:10,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 89 [2025-02-06 18:53:10,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 524 flow. Second operand has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 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-02-06 18:53:10,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:10,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 89 [2025-02-06 18:53:10,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:13,181 INFO L124 PetriNetUnfolderBase]: 10740/16792 cut-off events. [2025-02-06 18:53:13,181 INFO L125 PetriNetUnfolderBase]: For 6026/6026 co-relation queries the response was YES. [2025-02-06 18:53:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40200 conditions, 16792 events. 10740/16792 cut-off events. For 6026/6026 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 125167 event pairs, 4243 based on Foata normal form. 0/9843 useless extension candidates. Maximal degree in co-relation 40101. Up to 8951 conditions per place. [2025-02-06 18:53:13,325 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 119 selfloop transitions, 19 changer transitions 0/155 dead transitions. [2025-02-06 18:53:13,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 155 transitions, 913 flow [2025-02-06 18:53:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:53:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:53:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 357 transitions. [2025-02-06 18:53:13,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36465781409601633 [2025-02-06 18:53:13,327 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 524 flow. Second operand 11 states and 357 transitions. [2025-02-06 18:53:13,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 155 transitions, 913 flow [2025-02-06 18:53:13,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 884 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:53:13,333 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 536 flow [2025-02-06 18:53:13,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=536, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2025-02-06 18:53:13,333 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 12 predicate places. [2025-02-06 18:53:13,333 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 536 flow [2025-02-06 18:53:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 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-02-06 18:53:13,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:13,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:13,341 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-02-06 18:53:13,535 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,SelfDestructingSolverStorable6 [2025-02-06 18:53:13,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:13,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493597, now seen corresponding path program 1 times [2025-02-06 18:53:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164136521] [2025-02-06 18:53:13,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:13,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:13,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:13,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164136521] [2025-02-06 18:53:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164136521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347677344] [2025-02-06 18:53:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:13,940 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-02-06 18:53:13,943 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-02-06 18:53:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:14,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:14,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:14,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:14,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 18:53:14,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:14,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:53:14,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:53:14,125 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:53:14,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:53:14,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:53:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:14,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:14,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_97 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_97) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-02-06 18:53:14,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:14,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 18:53:14,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:14,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-02-06 18:53:14,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-06 18:53:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 18:53:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347677344] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:14,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-02-06 18:53:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360531024] [2025-02-06 18:53:14,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:14,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 18:53:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:14,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 18:53:14,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-02-06 18:53:14,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 89 [2025-02-06 18:53:14,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 536 flow. Second operand has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 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-02-06 18:53:14,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:14,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 89 [2025-02-06 18:53:14,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:16,146 INFO L124 PetriNetUnfolderBase]: 10198/15900 cut-off events. [2025-02-06 18:53:16,146 INFO L125 PetriNetUnfolderBase]: For 7193/7193 co-relation queries the response was YES. [2025-02-06 18:53:16,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38971 conditions, 15900 events. 10198/15900 cut-off events. For 7193/7193 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 120799 event pairs, 4691 based on Foata normal form. 0/9658 useless extension candidates. Maximal degree in co-relation 38871. Up to 8951 conditions per place. [2025-02-06 18:53:16,227 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 118 selfloop transitions, 19 changer transitions 0/154 dead transitions. [2025-02-06 18:53:16,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 154 transitions, 916 flow [2025-02-06 18:53:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:53:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:53:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 356 transitions. [2025-02-06 18:53:16,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-02-06 18:53:16,229 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 536 flow. Second operand 11 states and 356 transitions. [2025-02-06 18:53:16,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 154 transitions, 916 flow [2025-02-06 18:53:16,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 154 transitions, 879 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:53:16,235 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 533 flow [2025-02-06 18:53:16,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=533, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-02-06 18:53:16,235 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 16 predicate places. [2025-02-06 18:53:16,236 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 533 flow [2025-02-06 18:53:16,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 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-02-06 18:53:16,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:16,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:16,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:53:16,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:16,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493592, now seen corresponding path program 1 times [2025-02-06 18:53:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530785614] [2025-02-06 18:53:16,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:16,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:16,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:16,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:16,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:53:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:16,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530785614] [2025-02-06 18:53:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530785614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:53:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:53:16,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:53:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638629918] [2025-02-06 18:53:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:53:16,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:53:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:16,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:53:16,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:53:16,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:16,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-06 18:53:16,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:16,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:16,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:17,930 INFO L124 PetriNetUnfolderBase]: 8018/13920 cut-off events. [2025-02-06 18:53:17,930 INFO L125 PetriNetUnfolderBase]: For 9521/9521 co-relation queries the response was YES. [2025-02-06 18:53:17,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33949 conditions, 13920 events. 8018/13920 cut-off events. For 9521/9521 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 118153 event pairs, 2468 based on Foata normal form. 0/8676 useless extension candidates. Maximal degree in co-relation 33849. Up to 7419 conditions per place. [2025-02-06 18:53:17,980 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 106 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-02-06 18:53:17,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 806 flow [2025-02-06 18:53:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:53:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:53:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-02-06 18:53:17,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5543071161048689 [2025-02-06 18:53:17,982 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 533 flow. Second operand 3 states and 148 transitions. [2025-02-06 18:53:17,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 806 flow [2025-02-06 18:53:17,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 128 transitions, 769 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-06 18:53:17,987 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 498 flow [2025-02-06 18:53:17,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2025-02-06 18:53:17,988 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2025-02-06 18:53:17,988 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 498 flow [2025-02-06 18:53:17,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-06 18:53:17,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:17,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:17,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:53:17,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:17,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493591, now seen corresponding path program 1 times [2025-02-06 18:53:17,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:17,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377351917] [2025-02-06 18:53:17,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:17,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:53:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:53:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:53:18,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:18,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377351917] [2025-02-06 18:53:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377351917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:53:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:53:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:53:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439022904] [2025-02-06 18:53:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:53:18,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:53:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:18,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:53:18,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:53:18,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:18,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-06 18:53:18,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:18,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:18,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:19,377 INFO L124 PetriNetUnfolderBase]: 7476/13050 cut-off events. [2025-02-06 18:53:19,377 INFO L125 PetriNetUnfolderBase]: For 7950/7950 co-relation queries the response was YES. [2025-02-06 18:53:19,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31836 conditions, 13050 events. 7476/13050 cut-off events. For 7950/7950 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 110372 event pairs, 1968 based on Foata normal form. 221/8525 useless extension candidates. Maximal degree in co-relation 31738. Up to 7419 conditions per place. [2025-02-06 18:53:19,469 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 105 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2025-02-06 18:53:19,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 127 transitions, 769 flow [2025-02-06 18:53:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:53:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:53:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-02-06 18:53:19,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.550561797752809 [2025-02-06 18:53:19,471 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 498 flow. Second operand 3 states and 147 transitions. [2025-02-06 18:53:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 127 transitions, 769 flow [2025-02-06 18:53:19,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 127 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:53:19,479 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 500 flow [2025-02-06 18:53:19,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2025-02-06 18:53:19,481 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 11 predicate places. [2025-02-06 18:53:19,481 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 500 flow [2025-02-06 18:53:19,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-06 18:53:19,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:19,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:19,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:53:19,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:19,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 650980044, now seen corresponding path program 1 times [2025-02-06 18:53:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497635618] [2025-02-06 18:53:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:19,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:53:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:53:19,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:19,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:53:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497635618] [2025-02-06 18:53:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497635618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:53:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:53:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:53:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315056272] [2025-02-06 18:53:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:53:19,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:53:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:19,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:53:19,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:53:19,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 89 [2025-02-06 18:53:19,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-02-06 18:53:19,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:19,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 89 [2025-02-06 18:53:19,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:21,028 INFO L124 PetriNetUnfolderBase]: 9644/15404 cut-off events. [2025-02-06 18:53:21,028 INFO L125 PetriNetUnfolderBase]: For 9284/9284 co-relation queries the response was YES. [2025-02-06 18:53:21,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37776 conditions, 15404 events. 9644/15404 cut-off events. For 9284/9284 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 120047 event pairs, 7157 based on Foata normal form. 444/10557 useless extension candidates. Maximal degree in co-relation 37677. Up to 11378 conditions per place. [2025-02-06 18:53:21,117 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 131 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-02-06 18:53:21,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 151 transitions, 878 flow [2025-02-06 18:53:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:53:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:53:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-02-06 18:53:21,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5280898876404494 [2025-02-06 18:53:21,118 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 500 flow. Second operand 4 states and 188 transitions. [2025-02-06 18:53:21,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 151 transitions, 878 flow [2025-02-06 18:53:21,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 151 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:53:21,149 INFO L231 Difference]: Finished difference. Result has 105 places, 101 transitions, 521 flow [2025-02-06 18:53:21,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=521, PETRI_PLACES=105, PETRI_TRANSITIONS=101} [2025-02-06 18:53:21,149 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 16 predicate places. [2025-02-06 18:53:21,150 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 101 transitions, 521 flow [2025-02-06 18:53:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-02-06 18:53:21,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:21,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:53:21,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 629834393, now seen corresponding path program 1 times [2025-02-06 18:53:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112909936] [2025-02-06 18:53:21,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:21,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:53:21,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:53:21,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:21,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112909936] [2025-02-06 18:53:21,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112909936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133791226] [2025-02-06 18:53:21,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:21,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:21,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:21,248 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-02-06 18:53:21,249 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-02-06 18:53:21,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:53:21,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:53:21,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:21,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:21,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:53:21,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:21,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:53:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133791226] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:21,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:21,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 18:53:21,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857983859] [2025-02-06 18:53:21,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 18:53:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:21,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 18:53:21,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-06 18:53:21,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 89 [2025-02-06 18:53:21,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 521 flow. Second operand has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 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-02-06 18:53:21,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:21,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 89 [2025-02-06 18:53:21,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:23,807 INFO L124 PetriNetUnfolderBase]: 10188/16382 cut-off events. [2025-02-06 18:53:23,807 INFO L125 PetriNetUnfolderBase]: For 18660/18660 co-relation queries the response was YES. [2025-02-06 18:53:23,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44687 conditions, 16382 events. 10188/16382 cut-off events. For 18660/18660 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 123217 event pairs, 8260 based on Foata normal form. 0/10782 useless extension candidates. Maximal degree in co-relation 44550. Up to 11633 conditions per place. [2025-02-06 18:53:23,907 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 108 selfloop transitions, 51 changer transitions 0/176 dead transitions. [2025-02-06 18:53:23,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 176 transitions, 1237 flow [2025-02-06 18:53:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:53:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 18:53:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 389 transitions. [2025-02-06 18:53:23,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31219903691813805 [2025-02-06 18:53:23,909 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 521 flow. Second operand 14 states and 389 transitions. [2025-02-06 18:53:23,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 176 transitions, 1237 flow [2025-02-06 18:53:23,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:53:23,916 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 775 flow [2025-02-06 18:53:23,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=775, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-02-06 18:53:23,917 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-02-06 18:53:23,917 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 775 flow [2025-02-06 18:53:23,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 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-02-06 18:53:23,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:23,917 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-06 18:53:23,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:53:24,117 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-02-06 18:53:24,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:24,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1177314539, now seen corresponding path program 2 times [2025-02-06 18:53:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902289633] [2025-02-06 18:53:24,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:53:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:24,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:53:24,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-06 18:53:24,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:53:24,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:53:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902289633] [2025-02-06 18:53:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902289633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870598408] [2025-02-06 18:53:24,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:53:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:24,166 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-02-06 18:53:24,169 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-02-06 18:53:24,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:53:24,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-06 18:53:24,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:53:24,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:24,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:53:24,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:53:24,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:53:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870598408] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:24,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-06 18:53:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303750690] [2025-02-06 18:53:24,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:24,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:53:24,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:24,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:53:24,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:53:24,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-02-06 18:53:24,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 775 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-02-06 18:53:24,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:24,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-02-06 18:53:24,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:25,814 INFO L124 PetriNetUnfolderBase]: 9446/15623 cut-off events. [2025-02-06 18:53:25,815 INFO L125 PetriNetUnfolderBase]: For 16438/16438 co-relation queries the response was YES. [2025-02-06 18:53:25,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43266 conditions, 15623 events. 9446/15623 cut-off events. For 16438/16438 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 123090 event pairs, 8470 based on Foata normal form. 1/10530 useless extension candidates. Maximal degree in co-relation 43107. Up to 13551 conditions per place. [2025-02-06 18:53:25,920 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 82 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2025-02-06 18:53:25,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 961 flow [2025-02-06 18:53:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:53:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:53:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-02-06 18:53:25,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35674157303370785 [2025-02-06 18:53:25,922 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 775 flow. Second operand 4 states and 127 transitions. [2025-02-06 18:53:25,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 961 flow [2025-02-06 18:53:25,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 116 transitions, 936 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 18:53:25,937 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 772 flow [2025-02-06 18:53:25,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=772, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-02-06 18:53:25,938 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-02-06 18:53:25,938 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 772 flow [2025-02-06 18:53:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-02-06 18:53:25,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:25,939 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-02-06 18:53:25,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:53:26,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:26,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:26,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 928336124, now seen corresponding path program 1 times [2025-02-06 18:53:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832738635] [2025-02-06 18:53:26,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:26,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:53:26,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:53:26,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:26,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 18:53:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832738635] [2025-02-06 18:53:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832738635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:53:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:53:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:53:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669212047] [2025-02-06 18:53:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:53:26,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:53:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:26,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:53:26,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:53:26,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:26,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-02-06 18:53:26,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:26,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:26,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:27,949 INFO L124 PetriNetUnfolderBase]: 9445/15607 cut-off events. [2025-02-06 18:53:27,950 INFO L125 PetriNetUnfolderBase]: For 16319/16319 co-relation queries the response was YES. [2025-02-06 18:53:27,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43189 conditions, 15607 events. 9445/15607 cut-off events. For 16319/16319 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 122868 event pairs, 8470 based on Foata normal form. 1/10514 useless extension candidates. Maximal degree in co-relation 43089. Up to 13540 conditions per place. [2025-02-06 18:53:28,021 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 78 selfloop transitions, 8 changer transitions 1/106 dead transitions. [2025-02-06 18:53:28,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 106 transitions, 830 flow [2025-02-06 18:53:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:53:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:53:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-02-06 18:53:28,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41292134831460675 [2025-02-06 18:53:28,022 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 772 flow. Second operand 4 states and 147 transitions. [2025-02-06 18:53:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 106 transitions, 830 flow [2025-02-06 18:53:28,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 106 transitions, 757 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-02-06 18:53:28,033 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 594 flow [2025-02-06 18:53:28,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=594, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-02-06 18:53:28,034 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-02-06 18:53:28,034 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 594 flow [2025-02-06 18:53:28,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-02-06 18:53:28,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:28,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:28,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:53:28,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash -392113481, now seen corresponding path program 1 times [2025-02-06 18:53:28,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:28,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673449488] [2025-02-06 18:53:28,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:28,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:53:28,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:53:28,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:28,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673449488] [2025-02-06 18:53:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673449488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701932035] [2025-02-06 18:53:28,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:28,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:28,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:28,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:53:28,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:53:28,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:53:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:53:28,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:28,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:28,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 18:53:28,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:28,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:53:28,563 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-02-06 18:53:28,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:53:28,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:53:28,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 18:53:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:28,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:29,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:29,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 18:53:29,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:29,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-02-06 18:53:29,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 18:53:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701932035] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:29,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:29,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-02-06 18:53:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516560280] [2025-02-06 18:53:29,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:29,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 18:53:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:29,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 18:53:29,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=437, Unknown=6, NotChecked=0, Total=506 [2025-02-06 18:53:29,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 89 [2025-02-06 18:53:29,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 594 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:53:29,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:29,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 89 [2025-02-06 18:53:29,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:38,364 INFO L124 PetriNetUnfolderBase]: 42109/67469 cut-off events. [2025-02-06 18:53:38,364 INFO L125 PetriNetUnfolderBase]: For 67479/67479 co-relation queries the response was YES. [2025-02-06 18:53:38,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183831 conditions, 67469 events. 42109/67469 cut-off events. For 67479/67479 co-relation queries the response was YES. Maximal size of possible extension queue 2418. Compared 553224 event pairs, 25398 based on Foata normal form. 0/45003 useless extension candidates. Maximal degree in co-relation 183680. Up to 18193 conditions per place. [2025-02-06 18:53:38,901 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 366 selfloop transitions, 64 changer transitions 8/450 dead transitions. [2025-02-06 18:53:38,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 450 transitions, 3145 flow [2025-02-06 18:53:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 18:53:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 18:53:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 805 transitions. [2025-02-06 18:53:38,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.301498127340824 [2025-02-06 18:53:38,904 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 594 flow. Second operand 30 states and 805 transitions. [2025-02-06 18:53:38,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 450 transitions, 3145 flow [2025-02-06 18:53:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 450 transitions, 3127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:53:38,936 INFO L231 Difference]: Finished difference. Result has 146 places, 133 transitions, 888 flow [2025-02-06 18:53:38,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=888, PETRI_PLACES=146, PETRI_TRANSITIONS=133} [2025-02-06 18:53:38,937 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 57 predicate places. [2025-02-06 18:53:38,937 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 133 transitions, 888 flow [2025-02-06 18:53:38,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:53:38,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:38,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:38,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:53:39,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 18:53:39,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:39,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash -392113476, now seen corresponding path program 1 times [2025-02-06 18:53:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:39,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839595701] [2025-02-06 18:53:39,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:39,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:53:39,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:53:39,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:39,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:53:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839595701] [2025-02-06 18:53:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839595701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:53:39,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:53:39,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:53:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238581006] [2025-02-06 18:53:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:53:39,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:53:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:39,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:53:39,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:53:39,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-02-06 18:53:39,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 133 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-06 18:53:39,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:39,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-02-06 18:53:39,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:53:47,202 INFO L124 PetriNetUnfolderBase]: 38165/63545 cut-off events. [2025-02-06 18:53:47,202 INFO L125 PetriNetUnfolderBase]: For 87479/88375 co-relation queries the response was YES. [2025-02-06 18:53:47,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188306 conditions, 63545 events. 38165/63545 cut-off events. For 87479/88375 co-relation queries the response was YES. Maximal size of possible extension queue 3189. Compared 597100 event pairs, 14277 based on Foata normal form. 0/45611 useless extension candidates. Maximal degree in co-relation 188216. Up to 32305 conditions per place. [2025-02-06 18:53:47,821 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 152 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2025-02-06 18:53:47,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 176 transitions, 1409 flow [2025-02-06 18:53:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:53:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:53:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2025-02-06 18:53:47,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692883895131086 [2025-02-06 18:53:47,823 INFO L175 Difference]: Start difference. First operand has 146 places, 133 transitions, 888 flow. Second operand 3 states and 152 transitions. [2025-02-06 18:53:47,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 176 transitions, 1409 flow [2025-02-06 18:53:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 176 transitions, 1343 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-02-06 18:53:48,239 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 862 flow [2025-02-06 18:53:48,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2025-02-06 18:53:48,240 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 51 predicate places. [2025-02-06 18:53:48,240 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 862 flow [2025-02-06 18:53:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-06 18:53:48,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:53:48,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:53:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:53:48,240 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-06 18:53:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:53:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -392113482, now seen corresponding path program 1 times [2025-02-06 18:53:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:53:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500752963] [2025-02-06 18:53:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:53:48,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:53:48,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:53:48,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:48,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:48,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:53:48,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500752963] [2025-02-06 18:53:48,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500752963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:53:48,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888033428] [2025-02-06 18:53:48,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:53:48,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:53:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:53:48,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:53:48,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:53:48,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:53:48,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:53:48,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:53:48,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:53:48,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 18:53:48,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:53:48,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:53:48,819 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-02-06 18:53:48,912 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:53:48,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 18:53:48,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-06 18:53:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:49,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:53:49,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:49,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-06 18:53:49,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:53:49,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-02-06 18:53:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-06 18:53:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:53:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888033428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:53:49,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:53:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-02-06 18:53:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450824139] [2025-02-06 18:53:49,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:53:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 18:53:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:53:49,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 18:53:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=441, Unknown=2, NotChecked=0, Total=506 [2025-02-06 18:53:49,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 89 [2025-02-06 18:53:49,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 862 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:53:49,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:53:49,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 89 [2025-02-06 18:53:49,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand