./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.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-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:51:37,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:51:37,505 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:51:37,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:51:37,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:51:37,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:51:37,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:51:37,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:51:37,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:51:37,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:51:37,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:51:37,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:51:37,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:51:37,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:51:37,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:51:37,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:51:37,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:51:37,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:51:37,529 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-02-06 18:51:37,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:51:37,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:51:37,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:51:37,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:51:37,767 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:51:37,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 18:51:38,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66cf3fb0e/9631d506d12d4ba4abb9298a3d6ac474/FLAGe5cf128a0 [2025-02-06 18:51:39,208 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:51:39,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 18:51:39,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66cf3fb0e/9631d506d12d4ba4abb9298a3d6ac474/FLAGe5cf128a0 [2025-02-06 18:51:39,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66cf3fb0e/9631d506d12d4ba4abb9298a3d6ac474 [2025-02-06 18:51:39,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:51:39,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:51:39,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:51:39,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:51:39,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:51:39,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39, skipping insertion in model container [2025-02-06 18:51:39,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:51:39,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:51:39,683 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:51:39,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:51:39,718 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:51:39,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39 WrapperNode [2025-02-06 18:51:39,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:51:39,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:51:39,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:51:39,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:51:39,725 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:51:39" (1/1) ... [2025-02-06 18:51:39,730 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:51:39" (1/1) ... [2025-02-06 18:51:39,759 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 331 [2025-02-06 18:51:39,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:51:39,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:51:39,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:51:39,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:51:39,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,789 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-06 18:51:39,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:51:39,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:51:39,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:51:39,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:51:39,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (1/1) ... [2025-02-06 18:51:39,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:51:39,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:39,833 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:51:39,843 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:51:39,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:51:39,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:51:39,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:51:39,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:51:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:51:39,859 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:51:39,949 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:51:39,950 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:51:40,437 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:51:40,438 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:51:40,703 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:51:40,704 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:51:40,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:51:40 BoogieIcfgContainer [2025-02-06 18:51:40,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:51:40,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:51:40,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:51:40,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:51:40,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:51:39" (1/3) ... [2025-02-06 18:51:40,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cfa6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:51:40, skipping insertion in model container [2025-02-06 18:51:40,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:51:39" (2/3) ... [2025-02-06 18:51:40,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cfa6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:51:40, skipping insertion in model container [2025-02-06 18:51:40,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:51:40" (3/3) ... [2025-02-06 18:51:40,710 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 18:51:40,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:51:40,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 128 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-02-06 18:51:40,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:51:40,784 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:51:40,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 143 transitions, 307 flow [2025-02-06 18:51:40,837 INFO L124 PetriNetUnfolderBase]: 16/140 cut-off events. [2025-02-06 18:51:40,839 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:51:40,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 16/140 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 528 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2025-02-06 18:51:40,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 143 transitions, 307 flow [2025-02-06 18:51:40,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 139 transitions, 296 flow [2025-02-06 18:51:40,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:51:40,859 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;@254e83b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:51:40,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-02-06 18:51:40,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:51:40,865 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 18:51:40,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:51:40,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:40,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:51:40,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 999294, now seen corresponding path program 1 times [2025-02-06 18:51:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044687567] [2025-02-06 18:51:40,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:40,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:51:40,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:51:40,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:40,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:41,011 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:51:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044687567] [2025-02-06 18:51:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044687567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:41,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:51:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055825286] [2025-02-06 18:51:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:41,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:41,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:41,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:41,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:51:41,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 139 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:51:41,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:41,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:51:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:42,223 INFO L124 PetriNetUnfolderBase]: 6001/13087 cut-off events. [2025-02-06 18:51:42,223 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-02-06 18:51:42,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21245 conditions, 13087 events. 6001/13087 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 123206 event pairs, 3915 based on Foata normal form. 3/10275 useless extension candidates. Maximal degree in co-relation 20174. Up to 7899 conditions per place. [2025-02-06 18:51:42,319 INFO L140 encePairwiseOnDemand]: 127/143 looper letters, 61 selfloop transitions, 10 changer transitions 0/148 dead transitions. [2025-02-06 18:51:42,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 148 transitions, 456 flow [2025-02-06 18:51:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-02-06 18:51:42,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6940559440559441 [2025-02-06 18:51:42,335 INFO L175 Difference]: Start difference. First operand has 133 places, 139 transitions, 296 flow. Second operand 4 states and 397 transitions. [2025-02-06 18:51:42,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 148 transitions, 456 flow [2025-02-06 18:51:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 148 transitions, 444 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:51:42,350 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 372 flow [2025-02-06 18:51:42,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2025-02-06 18:51:42,356 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2025-02-06 18:51:42,356 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 372 flow [2025-02-06 18:51:42,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:51:42,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:42,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 18:51:42,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:51:42,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash -293973360, now seen corresponding path program 1 times [2025-02-06 18:51:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:42,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681752905] [2025-02-06 18:51:42,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:42,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:42,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:51:42,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:51:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:42,471 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:51:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681752905] [2025-02-06 18:51:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681752905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741556431] [2025-02-06 18:51:42,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:42,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:42,474 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:51:42,475 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:51:42,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:51:42,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:51:42,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:42,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:42,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:51:42,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:51:42,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:51:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741556431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:42,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:51:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:51:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050239975] [2025-02-06 18:51:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:51:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:51:42,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:51:42,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:51:42,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:51:42,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:42,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:51:42,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:43,538 INFO L124 PetriNetUnfolderBase]: 6001/13084 cut-off events. [2025-02-06 18:51:43,539 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-06 18:51:43,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21095 conditions, 13084 events. 6001/13084 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 123143 event pairs, 3915 based on Foata normal form. 3/10277 useless extension candidates. Maximal degree in co-relation 21022. Up to 7884 conditions per place. [2025-02-06 18:51:43,617 INFO L140 encePairwiseOnDemand]: 130/143 looper letters, 51 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2025-02-06 18:51:43,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 145 transitions, 496 flow [2025-02-06 18:51:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 551 transitions. [2025-02-06 18:51:43,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6421911421911422 [2025-02-06 18:51:43,623 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 372 flow. Second operand 6 states and 551 transitions. [2025-02-06 18:51:43,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 145 transitions, 496 flow [2025-02-06 18:51:43,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:43,627 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 394 flow [2025-02-06 18:51:43,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2025-02-06 18:51:43,629 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2025-02-06 18:51:43,629 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 394 flow [2025-02-06 18:51:43,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:51:43,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:43,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-06 18:51:43,644 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:51:43,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:43,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash -523238736, now seen corresponding path program 1 times [2025-02-06 18:51:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952568272] [2025-02-06 18:51:43,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:43,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:51:43,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:51:43,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:43,918 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:51:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952568272] [2025-02-06 18:51:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952568272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572021751] [2025-02-06 18:51:43,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:43,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:43,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:43,925 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:51:43,926 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:51:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:51:43,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:51:43,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:43,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:43,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:51:43,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:44,013 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:51:44,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:44,042 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:51:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572021751] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:44,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 18:51:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472875441] [2025-02-06 18:51:44,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:44,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:51:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:44,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:51:44,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:51:44,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:51:44,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 394 flow. Second operand has 12 states, 12 states have (on average 81.08333333333333) internal successors, (973), 12 states have internal predecessors, (973), 0 states have call successors, (0), 0 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:51:44,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:44,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:51:44,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:44,933 INFO L124 PetriNetUnfolderBase]: 6010/13120 cut-off events. [2025-02-06 18:51:44,933 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-06 18:51:44,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21236 conditions, 13120 events. 6010/13120 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 123529 event pairs, 3915 based on Foata normal form. 9/10319 useless extension candidates. Maximal degree in co-relation 21024. Up to 7899 conditions per place. [2025-02-06 18:51:44,984 INFO L140 encePairwiseOnDemand]: 130/143 looper letters, 58 selfloop transitions, 37 changer transitions 0/172 dead transitions. [2025-02-06 18:51:44,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 172 transitions, 758 flow [2025-02-06 18:51:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:51:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:51:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 904 transitions. [2025-02-06 18:51:44,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6321678321678321 [2025-02-06 18:51:44,987 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 394 flow. Second operand 10 states and 904 transitions. [2025-02-06 18:51:44,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 172 transitions, 758 flow [2025-02-06 18:51:44,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 172 transitions, 675 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-06 18:51:44,990 INFO L231 Difference]: Finished difference. Result has 142 places, 172 transitions, 609 flow [2025-02-06 18:51:44,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=609, PETRI_PLACES=142, PETRI_TRANSITIONS=172} [2025-02-06 18:51:44,991 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 9 predicate places. [2025-02-06 18:51:44,991 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 172 transitions, 609 flow [2025-02-06 18:51:44,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.08333333333333) internal successors, (973), 12 states have internal predecessors, (973), 0 states have call successors, (0), 0 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:51:44,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:44,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:45,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:51:45,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:45,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:45,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1112556272, now seen corresponding path program 1 times [2025-02-06 18:51:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328303696] [2025-02-06 18:51:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:45,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:51:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:51:45,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:45,292 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:51:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:45,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328303696] [2025-02-06 18:51:45,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328303696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:45,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489722451] [2025-02-06 18:51:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:45,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:45,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:45,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:51:45,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 172 transitions, 609 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:51:45,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:45,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:51:45,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:46,411 INFO L124 PetriNetUnfolderBase]: 12094/21962 cut-off events. [2025-02-06 18:51:46,412 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-06 18:51:46,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38238 conditions, 21962 events. 12094/21962 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 191407 event pairs, 3873 based on Foata normal form. 544/18388 useless extension candidates. Maximal degree in co-relation 38140. Up to 7304 conditions per place. [2025-02-06 18:51:46,512 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 152 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2025-02-06 18:51:46,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 231 transitions, 1045 flow [2025-02-06 18:51:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2025-02-06 18:51:46,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7762237762237763 [2025-02-06 18:51:46,515 INFO L175 Difference]: Start difference. First operand has 142 places, 172 transitions, 609 flow. Second operand 4 states and 444 transitions. [2025-02-06 18:51:46,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 231 transitions, 1045 flow [2025-02-06 18:51:46,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 231 transitions, 1008 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-06 18:51:46,521 INFO L231 Difference]: Finished difference. Result has 145 places, 174 transitions, 606 flow [2025-02-06 18:51:46,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=606, PETRI_PLACES=145, PETRI_TRANSITIONS=174} [2025-02-06 18:51:46,522 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 12 predicate places. [2025-02-06 18:51:46,522 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 174 transitions, 606 flow [2025-02-06 18:51:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:51:46,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:46,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:51:46,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:46,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -129505092, now seen corresponding path program 1 times [2025-02-06 18:51:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-02-06 18:51:46,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:46,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:51:46,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:51:46,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:46,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:46,665 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:51:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-02-06 18:51:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935448622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645001119] [2025-02-06 18:51:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:46,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:46,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-02-06 18:51:46,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 174 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:51:46,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:46,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-02-06 18:51:46,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:47,914 INFO L124 PetriNetUnfolderBase]: 9318/20210 cut-off events. [2025-02-06 18:51:47,914 INFO L125 PetriNetUnfolderBase]: For 3050/3430 co-relation queries the response was YES. [2025-02-06 18:51:47,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34796 conditions, 20210 events. 9318/20210 cut-off events. For 3050/3430 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 196615 event pairs, 5688 based on Foata normal form. 463/16896 useless extension candidates. Maximal degree in co-relation 34643. Up to 9525 conditions per place. [2025-02-06 18:51:47,993 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 167 selfloop transitions, 24 changer transitions 0/271 dead transitions. [2025-02-06 18:51:47,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 271 transitions, 1319 flow [2025-02-06 18:51:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions. [2025-02-06 18:51:47,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7703962703962703 [2025-02-06 18:51:47,999 INFO L175 Difference]: Start difference. First operand has 145 places, 174 transitions, 606 flow. Second operand 6 states and 661 transitions. [2025-02-06 18:51:47,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 271 transitions, 1319 flow [2025-02-06 18:51:48,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 271 transitions, 1319 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:48,029 INFO L231 Difference]: Finished difference. Result has 153 places, 184 transitions, 740 flow [2025-02-06 18:51:48,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=153, PETRI_TRANSITIONS=184} [2025-02-06 18:51:48,030 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 20 predicate places. [2025-02-06 18:51:48,032 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 184 transitions, 740 flow [2025-02-06 18:51:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:51:48,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:48,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:48,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:51:48,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:48,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1663055816, now seen corresponding path program 1 times [2025-02-06 18:51:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:48,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-02-06 18:51:48,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:48,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:51:48,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:51:48,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:48,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:48,101 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:51:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-02-06 18:51:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332200271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:48,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:48,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208696665] [2025-02-06 18:51:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:48,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:48,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:51:48,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 184 transitions, 740 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:51:48,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:48,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:51:48,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:49,958 INFO L124 PetriNetUnfolderBase]: 20139/36717 cut-off events. [2025-02-06 18:51:49,958 INFO L125 PetriNetUnfolderBase]: For 10358/10718 co-relation queries the response was YES. [2025-02-06 18:51:50,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72670 conditions, 36717 events. 20139/36717 cut-off events. For 10358/10718 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 334869 event pairs, 6781 based on Foata normal form. 1106/32499 useless extension candidates. Maximal degree in co-relation 72509. Up to 12828 conditions per place. [2025-02-06 18:51:50,334 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 170 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2025-02-06 18:51:50,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 249 transitions, 1288 flow [2025-02-06 18:51:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2025-02-06 18:51:50,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2025-02-06 18:51:50,337 INFO L175 Difference]: Start difference. First operand has 153 places, 184 transitions, 740 flow. Second operand 4 states and 442 transitions. [2025-02-06 18:51:50,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 249 transitions, 1288 flow [2025-02-06 18:51:50,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 249 transitions, 1284 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:50,426 INFO L231 Difference]: Finished difference. Result has 158 places, 186 transitions, 770 flow [2025-02-06 18:51:50,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=770, PETRI_PLACES=158, PETRI_TRANSITIONS=186} [2025-02-06 18:51:50,427 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 25 predicate places. [2025-02-06 18:51:50,428 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 186 transitions, 770 flow [2025-02-06 18:51:50,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:51:50,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:50,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:50,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:51:50,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:50,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash -15121747, now seen corresponding path program 1 times [2025-02-06 18:51:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-02-06 18:51:50,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:50,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:51:50,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:51:50,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:50,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:50,536 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:51:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-02-06 18:51:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53170435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513243463] [2025-02-06 18:51:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:50,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:50,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:50,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:50,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-02-06 18:51:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 186 transitions, 770 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:51:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-02-06 18:51:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:52,196 INFO L124 PetriNetUnfolderBase]: 10283/22518 cut-off events. [2025-02-06 18:51:52,196 INFO L125 PetriNetUnfolderBase]: For 8927/9848 co-relation queries the response was YES. [2025-02-06 18:51:52,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43361 conditions, 22518 events. 10283/22518 cut-off events. For 8927/9848 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 228959 event pairs, 6898 based on Foata normal form. 583/19414 useless extension candidates. Maximal degree in co-relation 43197. Up to 12830 conditions per place. [2025-02-06 18:51:52,298 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 154 selfloop transitions, 24 changer transitions 0/258 dead transitions. [2025-02-06 18:51:52,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 258 transitions, 1384 flow [2025-02-06 18:51:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions. [2025-02-06 18:51:52,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752913752913753 [2025-02-06 18:51:52,300 INFO L175 Difference]: Start difference. First operand has 158 places, 186 transitions, 770 flow. Second operand 6 states and 646 transitions. [2025-02-06 18:51:52,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 258 transitions, 1384 flow [2025-02-06 18:51:52,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 258 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:52,327 INFO L231 Difference]: Finished difference. Result has 165 places, 188 transitions, 840 flow [2025-02-06 18:51:52,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=840, PETRI_PLACES=165, PETRI_TRANSITIONS=188} [2025-02-06 18:51:52,328 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 32 predicate places. [2025-02-06 18:51:52,328 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 840 flow [2025-02-06 18:51:52,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:51:52,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:52,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:52,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:51:52,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:52,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1405500541, now seen corresponding path program 1 times [2025-02-06 18:51:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-02-06 18:51:52,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:52,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:51:52,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:51:52,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:52,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:52,374 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:51:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:52,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-02-06 18:51:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108538122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:51:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314425075] [2025-02-06 18:51:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:52,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:52,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:52,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:52,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:52,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 143 [2025-02-06 18:51:52,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 188 transitions, 840 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:51:52,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:52,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 143 [2025-02-06 18:51:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:54,791 INFO L124 PetriNetUnfolderBase]: 22898/41978 cut-off events. [2025-02-06 18:51:54,792 INFO L125 PetriNetUnfolderBase]: For 23547/25320 co-relation queries the response was YES. [2025-02-06 18:51:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91427 conditions, 41978 events. 22898/41978 cut-off events. For 23547/25320 co-relation queries the response was YES. Maximal size of possible extension queue 1751. Compared 398758 event pairs, 7161 based on Foata normal form. 2063/38697 useless extension candidates. Maximal degree in co-relation 91256. Up to 13115 conditions per place. [2025-02-06 18:51:55,072 INFO L140 encePairwiseOnDemand]: 128/143 looper letters, 174 selfloop transitions, 10 changer transitions 0/252 dead transitions. [2025-02-06 18:51:55,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 252 transitions, 1468 flow [2025-02-06 18:51:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:51:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:51:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2025-02-06 18:51:55,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2025-02-06 18:51:55,074 INFO L175 Difference]: Start difference. First operand has 165 places, 188 transitions, 840 flow. Second operand 4 states and 418 transitions. [2025-02-06 18:51:55,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 252 transitions, 1468 flow [2025-02-06 18:51:55,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 252 transitions, 1432 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:51:55,275 INFO L231 Difference]: Finished difference. Result has 166 places, 192 transitions, 870 flow [2025-02-06 18:51:55,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=870, PETRI_PLACES=166, PETRI_TRANSITIONS=192} [2025-02-06 18:51:55,279 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 33 predicate places. [2025-02-06 18:51:55,281 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 192 transitions, 870 flow [2025-02-06 18:51:55,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:51:55,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:55,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:51:55,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:51:55,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -620842789, now seen corresponding path program 1 times [2025-02-06 18:51:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-02-06 18:51:55,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:51:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:55,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:51:55,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:51:55,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:51:55,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:55,381 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:51:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-02-06 18:51:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330734440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:51:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:51:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:51:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839612250] [2025-02-06 18:51:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:51:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:51:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:55,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:51:55,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:51:55,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-02-06 18:51:55,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 192 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 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:51:55,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:55,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-02-06 18:51:55,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:51:57,723 INFO L124 PetriNetUnfolderBase]: 14000/30466 cut-off events. [2025-02-06 18:51:57,723 INFO L125 PetriNetUnfolderBase]: For 19784/21416 co-relation queries the response was YES. [2025-02-06 18:51:57,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65985 conditions, 30466 events. 14000/30466 cut-off events. For 19784/21416 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 327752 event pairs, 9891 based on Foata normal form. 874/27654 useless extension candidates. Maximal degree in co-relation 65815. Up to 18014 conditions per place. [2025-02-06 18:51:57,919 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 133 selfloop transitions, 24 changer transitions 0/237 dead transitions. [2025-02-06 18:51:57,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 237 transitions, 1396 flow [2025-02-06 18:51:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:51:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:51:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2025-02-06 18:51:57,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7237762237762237 [2025-02-06 18:51:57,923 INFO L175 Difference]: Start difference. First operand has 166 places, 192 transitions, 870 flow. Second operand 6 states and 621 transitions. [2025-02-06 18:51:57,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 237 transitions, 1396 flow [2025-02-06 18:51:58,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 237 transitions, 1396 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:51:58,341 INFO L231 Difference]: Finished difference. Result has 173 places, 194 transitions, 940 flow [2025-02-06 18:51:58,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=173, PETRI_TRANSITIONS=194} [2025-02-06 18:51:58,342 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 40 predicate places. [2025-02-06 18:51:58,342 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 194 transitions, 940 flow [2025-02-06 18:51:58,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 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:51:58,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:51:58,343 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-06 18:51:58,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:51:58,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:51:58,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:51:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1541002754, now seen corresponding path program 2 times [2025-02-06 18:51:58,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:51:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-02-06 18:51:58,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:51:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:51:58,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:51:58,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-06 18:51:58,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:51:58,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:58,371 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:51:58,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:51:58,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-02-06 18:51:58,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214458404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:51:58,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243111814] [2025-02-06 18:51:58,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:51:58,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:51:58,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:51:58,373 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:51:58,375 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:51:58,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:51:58,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-06 18:51:58,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:51:58,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:51:58,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:51:58,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:51:58,441 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:51:58,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:51:58,457 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:51:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243111814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:51:58,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:51:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-06 18:51:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675024208] [2025-02-06 18:51:58,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:51:58,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:51:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:51:58,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:51:58,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:51:58,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:51:58,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 194 transitions, 940 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:51:58,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:51:58,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:51:58,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:00,950 INFO L124 PetriNetUnfolderBase]: 13980/30830 cut-off events. [2025-02-06 18:52:00,950 INFO L125 PetriNetUnfolderBase]: For 20599/22158 co-relation queries the response was YES. [2025-02-06 18:52:01,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67250 conditions, 30830 events. 13980/30830 cut-off events. For 20599/22158 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 334419 event pairs, 9883 based on Foata normal form. 822/27899 useless extension candidates. Maximal degree in co-relation 67074. Up to 18186 conditions per place. [2025-02-06 18:52:01,178 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 100 selfloop transitions, 16 changer transitions 0/193 dead transitions. [2025-02-06 18:52:01,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 193 transitions, 1162 flow [2025-02-06 18:52:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:52:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:52:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2025-02-06 18:52:01,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625874125874126 [2025-02-06 18:52:01,184 INFO L175 Difference]: Start difference. First operand has 173 places, 194 transitions, 940 flow. Second operand 4 states and 379 transitions. [2025-02-06 18:52:01,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 193 transitions, 1162 flow [2025-02-06 18:52:01,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 193 transitions, 1126 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:52:01,322 INFO L231 Difference]: Finished difference. Result has 172 places, 193 transitions, 926 flow [2025-02-06 18:52:01,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=926, PETRI_PLACES=172, PETRI_TRANSITIONS=193} [2025-02-06 18:52:01,324 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 39 predicate places. [2025-02-06 18:52:01,324 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 193 transitions, 926 flow [2025-02-06 18:52:01,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:01,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:01,325 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-02-06 18:52:01,331 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:52:01,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:52:01,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:52:01,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1328385818, now seen corresponding path program 1 times [2025-02-06 18:52:01,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:01,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542445110] [2025-02-06 18:52:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:01,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:52:01,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:52:01,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:01,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:01,612 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:52:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:01,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542445110] [2025-02-06 18:52:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542445110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:52:01,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:52:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:52:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446833232] [2025-02-06 18:52:01,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:52:01,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:52:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:01,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:52:01,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:52:01,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-02-06 18:52:01,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 193 transitions, 926 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:01,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:01,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-02-06 18:52:01,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:03,756 INFO L124 PetriNetUnfolderBase]: 13970/30790 cut-off events. [2025-02-06 18:52:03,756 INFO L125 PetriNetUnfolderBase]: For 20454/22013 co-relation queries the response was YES. [2025-02-06 18:52:03,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67086 conditions, 30790 events. 13970/30790 cut-off events. For 20454/22013 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 334211 event pairs, 9883 based on Foata normal form. 823/27861 useless extension candidates. Maximal degree in co-relation 66973. Up to 18150 conditions per place. [2025-02-06 18:52:04,108 INFO L140 encePairwiseOnDemand]: 134/143 looper letters, 92 selfloop transitions, 16 changer transitions 0/187 dead transitions. [2025-02-06 18:52:04,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 187 transitions, 1062 flow [2025-02-06 18:52:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:52:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:52:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2025-02-06 18:52:04,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.722027972027972 [2025-02-06 18:52:04,110 INFO L175 Difference]: Start difference. First operand has 172 places, 193 transitions, 926 flow. Second operand 4 states and 413 transitions. [2025-02-06 18:52:04,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 187 transitions, 1062 flow [2025-02-06 18:52:04,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 187 transitions, 1018 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:52:04,232 INFO L231 Difference]: Finished difference. Result has 172 places, 187 transitions, 841 flow [2025-02-06 18:52:04,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=841, PETRI_PLACES=172, PETRI_TRANSITIONS=187} [2025-02-06 18:52:04,233 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 39 predicate places. [2025-02-06 18:52:04,233 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 187 transitions, 841 flow [2025-02-06 18:52:04,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:04,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:04,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:52:04,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:52:04,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:52:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash -89043697, now seen corresponding path program 1 times [2025-02-06 18:52:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:04,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962113851] [2025-02-06 18:52:04,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:04,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:52:04,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:52:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:04,606 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:52:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962113851] [2025-02-06 18:52:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962113851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:52:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667893656] [2025-02-06 18:52:04,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:04,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:52:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:52:04,609 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:52:04,614 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:52:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:52:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:52:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:04,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 18:52:04,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:52:04,698 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:52:04,731 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:52:04,770 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 18:52:04,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 18:52:04,795 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:52:04,854 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 18:52:04,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 18:52:04,876 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:52:04,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 18:52:04,929 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:52:04,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:52:04,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_131 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_131) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2025-02-06 18:52:05,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:52:05,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-06 18:52:05,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:52:05,123 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 73 treesize of output 69 [2025-02-06 18:52:05,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-02-06 18:52:05,134 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 54 treesize of output 50 [2025-02-06 18:52:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 18:52:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667893656] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:52:05,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:52:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-02-06 18:52:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996826658] [2025-02-06 18:52:05,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:52:05,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 18:52:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:05,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 18:52:05,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=464, Unknown=2, NotChecked=44, Total=600 [2025-02-06 18:52:05,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 143 [2025-02-06 18:52:05,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 187 transitions, 841 flow. Second operand has 25 states, 25 states have (on average 78.72) internal successors, (1968), 25 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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:05,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:05,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 143 [2025-02-06 18:52:05,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:52:12,744 INFO L124 PetriNetUnfolderBase]: 59454/91761 cut-off events. [2025-02-06 18:52:12,745 INFO L125 PetriNetUnfolderBase]: For 71580/78894 co-relation queries the response was YES. [2025-02-06 18:52:13,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230838 conditions, 91761 events. 59454/91761 cut-off events. For 71580/78894 co-relation queries the response was YES. Maximal size of possible extension queue 2731. Compared 767548 event pairs, 12789 based on Foata normal form. 3751/88986 useless extension candidates. Maximal degree in co-relation 230728. Up to 28504 conditions per place. [2025-02-06 18:52:13,622 INFO L140 encePairwiseOnDemand]: 124/143 looper letters, 271 selfloop transitions, 35 changer transitions 0/376 dead transitions. [2025-02-06 18:52:13,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 376 transitions, 2186 flow [2025-02-06 18:52:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 18:52:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 18:52:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1237 transitions. [2025-02-06 18:52:13,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6654115115653577 [2025-02-06 18:52:13,625 INFO L175 Difference]: Start difference. First operand has 172 places, 187 transitions, 841 flow. Second operand 13 states and 1237 transitions. [2025-02-06 18:52:13,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 376 transitions, 2186 flow [2025-02-06 18:52:13,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 376 transitions, 2152 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:52:13,971 INFO L231 Difference]: Finished difference. Result has 184 places, 199 transitions, 989 flow [2025-02-06 18:52:13,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=989, PETRI_PLACES=184, PETRI_TRANSITIONS=199} [2025-02-06 18:52:13,971 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 51 predicate places. [2025-02-06 18:52:13,971 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 199 transitions, 989 flow [2025-02-06 18:52:13,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 78.72) internal successors, (1968), 25 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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:13,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:52:13,972 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 18:52:13,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:52:14,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 18:52:14,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-06 18:52:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:52:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 575519864, now seen corresponding path program 1 times [2025-02-06 18:52:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:52:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-06 18:52:14,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:52:14,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:52:14,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:52:14,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:14,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:52:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:52:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-06 18:52:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582901109] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:52:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400878363] [2025-02-06 18:52:14,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:52:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:52:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:52:14,330 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:52:14,332 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:52:14,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:52:14,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:52:14,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:52:14,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:52:14,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:52:14,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:52:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:52:14,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:52:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:52:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400878363] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:52:14,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:52:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-06 18:52:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544295376] [2025-02-06 18:52:14,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:52:14,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 18:52:14,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:52:14,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 18:52:14,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-06 18:52:14,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-02-06 18:52:14,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 199 transitions, 989 flow. Second operand has 19 states, 19 states have (on average 81.21052631578948) internal successors, (1543), 19 states have internal predecessors, (1543), 0 states have call successors, (0), 0 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:14,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:52:14,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-02-06 18:52:14,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand