./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 47814a6c2066a31334f0b50a42e69cfeb567d5dd7f02dc6c703588c90e067366 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:28:20,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:28:20,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:28:20,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:28:20,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:28:20,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:28:20,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:28:20,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:28:20,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:28:20,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:28:20,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:28:20,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:28:20,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:28:20,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:28:20,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:28:20,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:28:20,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:28:20,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:20,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:28:20,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:28:20,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:28:20,618 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/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 -> 47814a6c2066a31334f0b50a42e69cfeb567d5dd7f02dc6c703588c90e067366 [2025-03-04 15:28:20,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:28:20,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:28:20,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:28:20,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:28:20,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:28:20,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2025-03-04 15:28:21,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2beecee63/295d1f2443634446bb1b0557aceba92f/FLAGf605e016b [2025-03-04 15:28:22,172 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:28:22,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2025-03-04 15:28:22,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2beecee63/295d1f2443634446bb1b0557aceba92f/FLAGf605e016b [2025-03-04 15:28:22,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2beecee63/295d1f2443634446bb1b0557aceba92f [2025-03-04 15:28:22,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:28:22,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:28:22,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:22,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:28:22,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:28:22,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b1c57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22, skipping insertion in model container [2025-03-04 15:28:22,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:28:22,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:22,639 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:28:22,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:22,675 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:28:22,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22 WrapperNode [2025-03-04 15:28:22,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:22,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:22,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:28:22,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:28:22,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,701 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 120 [2025-03-04 15:28:22,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:22,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:28:22,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:28:22,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:28:22,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,719 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:28:22,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:28:22,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:28:22,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:28:22,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:28:22,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (1/1) ... [2025-03-04 15:28:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:22,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:28:22,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:28:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:28:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:28:22,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:28:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:28:22,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:28:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:28:22,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:28:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 15:28:22,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 15:28:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:28:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:28:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:28:22,780 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:28:22,869 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:28:22,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:28:23,134 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:28:23,134 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:28:23,248 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:28:23,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:28:23,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:23 BoogieIcfgContainer [2025-03-04 15:28:23,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:28:23,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:28:23,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:28:23,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:28:23,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:28:22" (1/3) ... [2025-03-04 15:28:23,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456f60ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:23, skipping insertion in model container [2025-03-04 15:28:23,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:22" (2/3) ... [2025-03-04 15:28:23,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456f60ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:23, skipping insertion in model container [2025-03-04 15:28:23,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:23" (3/3) ... [2025-03-04 15:28:23,259 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2025-03-04 15:28:23,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:28:23,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-dec.wvr.c that has 5 procedures, 78 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-04 15:28:23,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:28:23,325 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 15:28:23,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 84 transitions, 196 flow [2025-03-04 15:28:23,379 INFO L124 PetriNetUnfolderBase]: 7/80 cut-off events. [2025-03-04 15:28:23,382 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 15:28:23,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 80 events. 7/80 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2025-03-04 15:28:23,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 84 transitions, 196 flow [2025-03-04 15:28:23,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 78 transitions, 177 flow [2025-03-04 15:28:23,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:28:23,405 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;@7b962df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:28:23,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 15:28:23,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:28:23,409 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-03-04 15:28:23,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:28:23,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:23,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:28:23,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 472635679, now seen corresponding path program 1 times [2025-03-04 15:28:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434443771] [2025-03-04 15:28:23,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:28:23,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:28:23,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:23,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434443771] [2025-03-04 15:28:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434443771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:23,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:23,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844719766] [2025-03-04 15:28:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:23,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:23,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:23,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:23,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-03-04 15:28:23,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-03-04 15:28:23,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:23,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-03-04 15:28:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:26,834 INFO L124 PetriNetUnfolderBase]: 37330/58506 cut-off events. [2025-03-04 15:28:26,834 INFO L125 PetriNetUnfolderBase]: For 1917/1917 co-relation queries the response was YES. [2025-03-04 15:28:26,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107878 conditions, 58506 events. 37330/58506 cut-off events. For 1917/1917 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 475545 event pairs, 27934 based on Foata normal form. 1/51047 useless extension candidates. Maximal degree in co-relation 103409. Up to 47232 conditions per place. [2025-03-04 15:28:27,255 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 49 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-04 15:28:27,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 289 flow [2025-03-04 15:28:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-03-04 15:28:27,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-03-04 15:28:27,270 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 177 flow. Second operand 4 states and 183 transitions. [2025-03-04 15:28:27,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 289 flow [2025-03-04 15:28:27,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 276 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:28:27,379 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 193 flow [2025-03-04 15:28:27,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-03-04 15:28:27,385 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2025-03-04 15:28:27,386 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 193 flow [2025-03-04 15:28:27,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-03-04 15:28:27,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:27,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:27,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:28:27,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:27,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1387110353, now seen corresponding path program 1 times [2025-03-04 15:28:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850602877] [2025-03-04 15:28:27,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:28:27,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:28:27,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850602877] [2025-03-04 15:28:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850602877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884337271] [2025-03-04 15:28:27,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:27,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:27,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:27,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:27,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:28:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:28:27,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:28:27,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:27,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:27,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:27,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:27,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884337271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:28:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828672329] [2025-03-04 15:28:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:28:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:27,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:28:27,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:28:27,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-03-04 15:28:27,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:27,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:27,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-03-04 15:28:27,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:30,438 INFO L124 PetriNetUnfolderBase]: 37330/58505 cut-off events. [2025-03-04 15:28:30,438 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-03-04 15:28:30,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107345 conditions, 58505 events. 37330/58505 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 475614 event pairs, 27934 based on Foata normal form. 1/51047 useless extension candidates. Maximal degree in co-relation 107318. Up to 47227 conditions per place. [2025-03-04 15:28:30,707 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 45 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2025-03-04 15:28:30,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 293 flow [2025-03-04 15:28:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:28:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:28:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-03-04 15:28:30,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-03-04 15:28:30,709 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 193 flow. Second operand 6 states and 245 transitions. [2025-03-04 15:28:30,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 293 flow [2025-03-04 15:28:30,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 80 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:30,711 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 200 flow [2025-03-04 15:28:30,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-03-04 15:28:30,712 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 1 predicate places. [2025-03-04 15:28:30,712 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 200 flow [2025-03-04 15:28:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:30,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:30,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:28:30,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:28:30,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:30,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:30,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 50748378, now seen corresponding path program 1 times [2025-03-04 15:28:30,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:30,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416614417] [2025-03-04 15:28:30,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:30,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:30,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:30,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416614417] [2025-03-04 15:28:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416614417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843967897] [2025-03-04 15:28:31,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:31,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:31,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:28:31,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:31,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:31,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:31,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:31,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:31,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:31,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843967897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:31,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:28:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178986421] [2025-03-04 15:28:31,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:31,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:28:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:31,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:28:31,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:31,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-03-04 15:28:31,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 200 flow. Second operand has 12 states, 12 states have (on average 33.25) internal successors, (399), 12 states have internal predecessors, (399), 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-03-04 15:28:31,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:31,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-03-04 15:28:31,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:33,671 INFO L124 PetriNetUnfolderBase]: 37333/58517 cut-off events. [2025-03-04 15:28:33,671 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2025-03-04 15:28:33,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107389 conditions, 58517 events. 37333/58517 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 475621 event pairs, 27934 based on Foata normal form. 3/51059 useless extension candidates. Maximal degree in co-relation 107319. Up to 47234 conditions per place. [2025-03-04 15:28:33,940 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 48 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2025-03-04 15:28:33,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 376 flow [2025-03-04 15:28:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:28:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:28:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 384 transitions. [2025-03-04 15:28:33,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-04 15:28:33,943 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 200 flow. Second operand 10 states and 384 transitions. [2025-03-04 15:28:33,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 376 flow [2025-03-04 15:28:33,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 330 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:33,946 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 252 flow [2025-03-04 15:28:33,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=252, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-04 15:28:33,947 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 8 predicate places. [2025-03-04 15:28:33,947 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 252 flow [2025-03-04 15:28:33,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.25) internal successors, (399), 12 states have internal predecessors, (399), 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-03-04 15:28:33,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:33,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:33,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:34,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:28:34,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:34,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2142795597, now seen corresponding path program 1 times [2025-03-04 15:28:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44447832] [2025-03-04 15:28:34,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:34,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:28:34,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:28:34,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:34,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44447832] [2025-03-04 15:28:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44447832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618461543] [2025-03-04 15:28:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:34,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:34,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:34,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:34,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-03-04 15:28:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-03-04 15:28:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:36,481 INFO L124 PetriNetUnfolderBase]: 35048/51511 cut-off events. [2025-03-04 15:28:36,481 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2025-03-04 15:28:36,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97437 conditions, 51511 events. 35048/51511 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 373348 event pairs, 14967 based on Foata normal form. 0/46767 useless extension candidates. Maximal degree in co-relation 97403. Up to 26562 conditions per place. [2025-03-04 15:28:36,792 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 110 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2025-03-04 15:28:36,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 142 transitions, 592 flow [2025-03-04 15:28:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2025-03-04 15:28:36,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 15:28:36,793 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 252 flow. Second operand 4 states and 238 transitions. [2025-03-04 15:28:36,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 142 transitions, 592 flow [2025-03-04 15:28:36,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 142 transitions, 581 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:36,796 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 245 flow [2025-03-04 15:28:36,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-03-04 15:28:36,796 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 8 predicate places. [2025-03-04 15:28:36,796 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 245 flow [2025-03-04 15:28:36,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:36,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:36,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:36,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:28:36,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2142795598, now seen corresponding path program 1 times [2025-03-04 15:28:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949763939] [2025-03-04 15:28:36,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:28:36,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:28:36,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:36,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949763939] [2025-03-04 15:28:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949763939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645768954] [2025-03-04 15:28:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:36,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:36,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:36,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:36,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-03-04 15:28:36,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-03-04 15:28:36,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:36,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-03-04 15:28:36,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:39,214 INFO L124 PetriNetUnfolderBase]: 33196/52285 cut-off events. [2025-03-04 15:28:39,215 INFO L125 PetriNetUnfolderBase]: For 3167/3167 co-relation queries the response was YES. [2025-03-04 15:28:39,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98951 conditions, 52285 events. 33196/52285 cut-off events. For 3167/3167 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 422068 event pairs, 24690 based on Foata normal form. 1/47432 useless extension candidates. Maximal degree in co-relation 98920. Up to 42015 conditions per place. [2025-03-04 15:28:39,482 INFO L140 encePairwiseOnDemand]: 81/84 looper letters, 56 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-04 15:28:39,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 358 flow [2025-03-04 15:28:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2025-03-04 15:28:39,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-03-04 15:28:39,484 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 245 flow. Second operand 3 states and 152 transitions. [2025-03-04 15:28:39,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 358 flow [2025-03-04 15:28:39,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 352 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:28:39,491 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 240 flow [2025-03-04 15:28:39,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-03-04 15:28:39,492 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2025-03-04 15:28:39,492 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 240 flow [2025-03-04 15:28:39,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-03-04 15:28:39,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:39,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:28:39,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:39,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1293543204, now seen corresponding path program 1 times [2025-03-04 15:28:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:39,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962092435] [2025-03-04 15:28:39,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:39,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:39,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:39,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:39,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962092435] [2025-03-04 15:28:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962092435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730887327] [2025-03-04 15:28:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:39,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:39,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:39,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:39,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:28:39,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:39,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:39,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:39,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:39,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:28:39,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:39,841 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-03-04 15:28:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:39,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:28:39,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:28:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730887327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:39,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-04 15:28:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757268049] [2025-03-04 15:28:39,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:28:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:39,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:28:39,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:28:39,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-03-04 15:28:40,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 36.46153846153846) internal successors, (474), 13 states have internal predecessors, (474), 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-03-04 15:28:40,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:40,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-03-04 15:28:40,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:44,176 INFO L124 PetriNetUnfolderBase]: 60378/87480 cut-off events. [2025-03-04 15:28:44,176 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2025-03-04 15:28:44,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166102 conditions, 87480 events. 60378/87480 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 644917 event pairs, 19296 based on Foata normal form. 0/81572 useless extension candidates. Maximal degree in co-relation 166078. Up to 34221 conditions per place. [2025-03-04 15:28:44,673 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 131 selfloop transitions, 14 changer transitions 0/174 dead transitions. [2025-03-04 15:28:44,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 174 transitions, 716 flow [2025-03-04 15:28:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:28:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:28:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 443 transitions. [2025-03-04 15:28:44,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859788359788359 [2025-03-04 15:28:44,675 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 240 flow. Second operand 9 states and 443 transitions. [2025-03-04 15:28:44,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 174 transitions, 716 flow [2025-03-04 15:28:44,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 174 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:44,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 300 flow [2025-03-04 15:28:44,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2025-03-04 15:28:44,678 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2025-03-04 15:28:44,678 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 300 flow [2025-03-04 15:28:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.46153846153846) internal successors, (474), 13 states have internal predecessors, (474), 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-03-04 15:28:44,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:44,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:44,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:44,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:44,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:44,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1344475851, now seen corresponding path program 1 times [2025-03-04 15:28:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:44,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076978159] [2025-03-04 15:28:44,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:44,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:28:44,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:28:44,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:44,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076978159] [2025-03-04 15:28:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076978159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:44,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138724276] [2025-03-04 15:28:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:44,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:44,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:44,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-03-04 15:28:44,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-03-04 15:28:44,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:44,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-03-04 15:28:44,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:52,184 INFO L124 PetriNetUnfolderBase]: 97966/146656 cut-off events. [2025-03-04 15:28:52,184 INFO L125 PetriNetUnfolderBase]: For 46354/46354 co-relation queries the response was YES. [2025-03-04 15:28:52,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305959 conditions, 146656 events. 97966/146656 cut-off events. For 46354/46354 co-relation queries the response was YES. Maximal size of possible extension queue 4119. Compared 1216524 event pairs, 11073 based on Foata normal form. 2198/136984 useless extension candidates. Maximal degree in co-relation 305922. Up to 61986 conditions per place. [2025-03-04 15:28:53,309 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 156 selfloop transitions, 5 changer transitions 0/188 dead transitions. [2025-03-04 15:28:53,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 188 transitions, 930 flow [2025-03-04 15:28:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2025-03-04 15:28:53,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-03-04 15:28:53,311 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 300 flow. Second operand 5 states and 292 transitions. [2025-03-04 15:28:53,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 188 transitions, 930 flow [2025-03-04 15:28:53,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 188 transitions, 920 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:28:53,335 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 324 flow [2025-03-04 15:28:53,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-03-04 15:28:53,335 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2025-03-04 15:28:53,335 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 324 flow [2025-03-04 15:28:53,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-03-04 15:28:53,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:53,336 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-04 15:28:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:28:53,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-04 15:28:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1026340556, now seen corresponding path program 2 times [2025-03-04 15:28:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949939163] [2025-03-04 15:28:53,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:53,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:53,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:28:53,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 15:28:53,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:53,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:53,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949939163] [2025-03-04 15:28:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949939163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116832927] [2025-03-04 15:28:53,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:53,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:53,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:53,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:28:53,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:28:53,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 15:28:53,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:53,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:53,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:28:53,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:53,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:28:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116832927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:53,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 15:28:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701444552] [2025-03-04 15:28:53,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:53,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:28:53,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:28:53,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:28:53,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 84 [2025-03-04 15:28:53,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:53,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:53,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 84 [2025-03-04 15:28:53,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand