./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/chl-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:38:39,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:38:39,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:38:39,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:38:39,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:38:39,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:38:39,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:38:39,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:38:39,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:38:39,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:38:39,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:38:39,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:38:39,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:38:39,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:38:39,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:38:39,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:38:39,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:38:39,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:38:39,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:38:39,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:38:39,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:38:39,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:38:39,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:38:39,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:38:39,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:38:39,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:38:39,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:38:39,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:38:39,110 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-03-09 06:38:39,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:38:39,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:38:39,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:38:39,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:38:39,359 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:38:39,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-09 06:38:40,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c02f37a/198391e2253344c6aee4c0b7a0415794/FLAG16ad14e92 [2025-03-09 06:38:40,866 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:38:40,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-09 06:38:40,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c02f37a/198391e2253344c6aee4c0b7a0415794/FLAG16ad14e92 [2025-03-09 06:38:41,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c02f37a/198391e2253344c6aee4c0b7a0415794 [2025-03-09 06:38:41,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:38:41,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:38:41,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:38:41,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:38:41,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:38:41,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41, skipping insertion in model container [2025-03-09 06:38:41,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:38:41,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:38:41,376 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:38:41,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:38:41,422 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:38:41,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41 WrapperNode [2025-03-09 06:38:41,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:38:41,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:38:41,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:38:41,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:38:41,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,464 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-03-09 06:38:41,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:38:41,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:38:41,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:38:41,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:38:41,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,508 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-09 06:38:41,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:38:41,535 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:38:41,535 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:38:41,535 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:38:41,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (1/1) ... [2025-03-09 06:38:41,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:38:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:41,566 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-09 06:38:41,568 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-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:38:41,585 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:38:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:38:41,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:38:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 06:38:41,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 06:38:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:38:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:38:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:38:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:38:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:38:41,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:38:41,587 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:38:41,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:38:41,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:38:42,335 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:38:42,335 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:38:42,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:38:42,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:38:42,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:38:42 BoogieIcfgContainer [2025-03-09 06:38:42,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:38:42,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:38:42,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:38:42,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:38:42,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:38:41" (1/3) ... [2025-03-09 06:38:42,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919a86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:38:42, skipping insertion in model container [2025-03-09 06:38:42,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:41" (2/3) ... [2025-03-09 06:38:42,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919a86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:38:42, skipping insertion in model container [2025-03-09 06:38:42,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:38:42" (3/3) ... [2025-03-09 06:38:42,733 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-03-09 06:38:42,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:38:42,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 126 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-03-09 06:38:42,747 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:38:42,821 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:38:42,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 140 transitions, 301 flow [2025-03-09 06:38:42,893 INFO L124 PetriNetUnfolderBase]: 15/137 cut-off events. [2025-03-09 06:38:42,895 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:38:42,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 15/137 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 407 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2025-03-09 06:38:42,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 140 transitions, 301 flow [2025-03-09 06:38:42,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 135 transitions, 285 flow [2025-03-09 06:38:42,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:38:42,923 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;@1c082481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:38:42,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-09 06:38:42,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:38:42,928 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-09 06:38:42,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:38:42,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:42,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 06:38:42,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:42,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 43291, now seen corresponding path program 1 times [2025-03-09 06:38:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:42,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-09 06:38:42,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:43,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:38:43,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:38:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:43,112 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-09 06:38:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-09 06:38:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826152392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:38:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802231450] [2025-03-09 06:38:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:43,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:38:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:43,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:38:43,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:38:43,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:43,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-09 06:38:43,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:43,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:44,190 INFO L124 PetriNetUnfolderBase]: 4133/8026 cut-off events. [2025-03-09 06:38:44,191 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-03-09 06:38:44,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13743 conditions, 8026 events. 4133/8026 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 65909 event pairs, 2732 based on Foata normal form. 2/6384 useless extension candidates. Maximal degree in co-relation 13014. Up to 5498 conditions per place. [2025-03-09 06:38:44,248 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 61 selfloop transitions, 1 changer transitions 0/133 dead transitions. [2025-03-09 06:38:44,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 133 transitions, 405 flow [2025-03-09 06:38:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:38:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:38:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-09 06:38:44,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-09 06:38:44,261 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 285 flow. Second operand 3 states and 286 transitions. [2025-03-09 06:38:44,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 133 transitions, 405 flow [2025-03-09 06:38:44,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:38:44,272 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 274 flow [2025-03-09 06:38:44,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=125, PETRI_TRANSITIONS=133} [2025-03-09 06:38:44,277 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-09 06:38:44,278 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 274 flow [2025-03-09 06:38:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-09 06:38:44,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:44,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:38:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:38:44,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1343291, now seen corresponding path program 1 times [2025-03-09 06:38:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825959660] [2025-03-09 06:38:44,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:44,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:38:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:38:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:44,363 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-09 06:38:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825959660] [2025-03-09 06:38:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825959660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:44,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:38:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325941177] [2025-03-09 06:38:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:44,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:38:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:44,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:38:44,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:38:44,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:44,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-09 06:38:44,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:44,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:44,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:44,932 INFO L124 PetriNetUnfolderBase]: 4133/8024 cut-off events. [2025-03-09 06:38:44,932 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-09 06:38:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13658 conditions, 8024 events. 4133/8024 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66066 event pairs, 2732 based on Foata normal form. 0/6382 useless extension candidates. Maximal degree in co-relation 13652. Up to 5496 conditions per place. [2025-03-09 06:38:45,029 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 59 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-03-09 06:38:45,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 390 flow [2025-03-09 06:38:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:38:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:38:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-09 06:38:45,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-09 06:38:45,036 INFO L175 Difference]: Start difference. First operand has 125 places, 133 transitions, 274 flow. Second operand 3 states and 284 transitions. [2025-03-09 06:38:45,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 131 transitions, 390 flow [2025-03-09 06:38:45,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 131 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:45,039 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 271 flow [2025-03-09 06:38:45,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2025-03-09 06:38:45,040 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-03-09 06:38:45,040 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 271 flow [2025-03-09 06:38:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-09 06:38:45,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:45,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:38:45,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:38:45,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1290942784, now seen corresponding path program 1 times [2025-03-09 06:38:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-03-09 06:38:45,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:45,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:38:45,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:38:45,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:45,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:45,171 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-09 06:38:45,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:45,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-03-09 06:38:45,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238420786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103371305] [2025-03-09 06:38:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:45,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:45,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:45,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:38:45,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 131 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-09 06:38:45,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:45,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:38:45,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:45,934 INFO L124 PetriNetUnfolderBase]: 4136/8036 cut-off events. [2025-03-09 06:38:45,934 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-09 06:38:45,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13686 conditions, 8036 events. 4136/8036 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66136 event pairs, 2732 based on Foata normal form. 3/6394 useless extension candidates. Maximal degree in co-relation 13679. Up to 5506 conditions per place. [2025-03-09 06:38:45,963 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 63 selfloop transitions, 12 changer transitions 0/140 dead transitions. [2025-03-09 06:38:45,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 140 transitions, 439 flow [2025-03-09 06:38:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-09 06:38:45,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-03-09 06:38:45,966 INFO L175 Difference]: Start difference. First operand has 124 places, 131 transitions, 271 flow. Second operand 4 states and 369 transitions. [2025-03-09 06:38:45,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 140 transitions, 439 flow [2025-03-09 06:38:45,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 140 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:45,970 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 357 flow [2025-03-09 06:38:45,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-03-09 06:38:45,971 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-03-09 06:38:45,971 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 357 flow [2025-03-09 06:38:45,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-09 06:38:45,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:45,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:38:45,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:38:45,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:45,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1290942774, now seen corresponding path program 1 times [2025-03-09 06:38:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559120703] [2025-03-09 06:38:45,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:45,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:38:45,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:38:45,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:45,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:46,027 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-09 06:38:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559120703] [2025-03-09 06:38:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559120703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:46,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:38:46,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373021213] [2025-03-09 06:38:46,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:46,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:38:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:46,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:38:46,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:38:46,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:46,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 140 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:46,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:46,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:46,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:46,536 INFO L124 PetriNetUnfolderBase]: 4136/8034 cut-off events. [2025-03-09 06:38:46,536 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-09 06:38:46,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 8034 events. 4136/8034 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66143 event pairs, 2732 based on Foata normal form. 2/6398 useless extension candidates. Maximal degree in co-relation 13709. Up to 5507 conditions per place. [2025-03-09 06:38:46,571 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-03-09 06:38:46,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 495 flow [2025-03-09 06:38:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:38:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:38:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-09 06:38:46,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-09 06:38:46,573 INFO L175 Difference]: Start difference. First operand has 128 places, 140 transitions, 357 flow. Second operand 3 states and 286 transitions. [2025-03-09 06:38:46,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 495 flow [2025-03-09 06:38:46,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:46,575 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 346 flow [2025-03-09 06:38:46,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2025-03-09 06:38:46,576 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-09 06:38:46,576 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 346 flow [2025-03-09 06:38:46,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:46,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:46,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:38:46,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:38:46,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:46,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1364521629, now seen corresponding path program 1 times [2025-03-09 06:38:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:46,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067110765] [2025-03-09 06:38:46,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:46,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:38:46,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:38:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:46,629 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-09 06:38:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067110765] [2025-03-09 06:38:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067110765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:46,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:38:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092433333] [2025-03-09 06:38:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:46,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:38:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:46,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:38:46,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:38:46,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:46,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:46,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:46,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:47,082 INFO L124 PetriNetUnfolderBase]: 4136/8032 cut-off events. [2025-03-09 06:38:47,083 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 06:38:47,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 8032 events. 4136/8032 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66095 event pairs, 2732 based on Foata normal form. 1/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5505 conditions per place. [2025-03-09 06:38:47,124 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2025-03-09 06:38:47,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 480 flow [2025-03-09 06:38:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:38:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:38:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-09 06:38:47,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-09 06:38:47,126 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 346 flow. Second operand 3 states and 284 transitions. [2025-03-09 06:38:47,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 480 flow [2025-03-09 06:38:47,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:47,128 INFO L231 Difference]: Finished difference. Result has 126 places, 136 transitions, 343 flow [2025-03-09 06:38:47,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=126, PETRI_TRANSITIONS=136} [2025-03-09 06:38:47,129 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-09 06:38:47,129 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 136 transitions, 343 flow [2025-03-09 06:38:47,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:47,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:47,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:47,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:38:47,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1340302992, now seen corresponding path program 1 times [2025-03-09 06:38:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754886961] [2025-03-09 06:38:47,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:47,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:38:47,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:38:47,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:47,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:47,175 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-09 06:38:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754886961] [2025-03-09 06:38:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754886961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:47,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:38:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196647196] [2025-03-09 06:38:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:47,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:38:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:38:47,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:38:47,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:47,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 136 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:47,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:47,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:47,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:48,016 INFO L124 PetriNetUnfolderBase]: 4136/8030 cut-off events. [2025-03-09 06:38:48,017 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 06:38:48,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 8030 events. 4136/8030 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66083 event pairs, 2732 based on Foata normal form. 2/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5507 conditions per place. [2025-03-09 06:38:48,093 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2025-03-09 06:38:48,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 481 flow [2025-03-09 06:38:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:38:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:38:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-09 06:38:48,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-09 06:38:48,096 INFO L175 Difference]: Start difference. First operand has 126 places, 136 transitions, 343 flow. Second operand 3 states and 286 transitions. [2025-03-09 06:38:48,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 481 flow [2025-03-09 06:38:48,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 134 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:48,100 INFO L231 Difference]: Finished difference. Result has 125 places, 134 transitions, 340 flow [2025-03-09 06:38:48,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=125, PETRI_TRANSITIONS=134} [2025-03-09 06:38:48,103 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-09 06:38:48,104 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 134 transitions, 340 flow [2025-03-09 06:38:48,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:48,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:48,105 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:48,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:38:48,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:48,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1340505976, now seen corresponding path program 1 times [2025-03-09 06:38:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:48,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-03-09 06:38:48,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:48,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:38:48,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:38:48,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:48,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:48,214 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-09 06:38:48,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:48,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-03-09 06:38:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125919774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:48,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16283015] [2025-03-09 06:38:48,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:48,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:48,218 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-09 06:38:48,219 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-09 06:38:48,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:38:48,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:38:48,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:48,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:48,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:38:48,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:48,329 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-09 06:38:48,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:38:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16283015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:38:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:38:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532172894] [2025-03-09 06:38:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:48,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:38:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:48,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:38:48,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:38:48,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:38:48,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 134 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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-09 06:38:48,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:48,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:38:48,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:48,974 INFO L124 PetriNetUnfolderBase]: 4136/8027 cut-off events. [2025-03-09 06:38:48,974 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 06:38:48,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 8027 events. 4136/8027 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66012 event pairs, 2732 based on Foata normal form. 3/6392 useless extension candidates. Maximal degree in co-relation 13694. Up to 5491 conditions per place. [2025-03-09 06:38:49,003 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 51 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2025-03-09 06:38:49,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 472 flow [2025-03-09 06:38:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:38:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:38:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-03-09 06:38:49,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-03-09 06:38:49,006 INFO L175 Difference]: Start difference. First operand has 125 places, 134 transitions, 340 flow. Second operand 6 states and 507 transitions. [2025-03-09 06:38:49,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 472 flow [2025-03-09 06:38:49,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 131 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:49,012 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 369 flow [2025-03-09 06:38:49,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2025-03-09 06:38:49,012 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-09 06:38:49,013 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 369 flow [2025-03-09 06:38:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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-09 06:38:49,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:49,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:49,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:38:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:49,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1400278975, now seen corresponding path program 1 times [2025-03-09 06:38:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-03-09 06:38:49,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:49,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:38:49,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:38:49,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:49,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:49,280 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-09 06:38:49,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:49,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-03-09 06:38:49,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499218895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:49,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:38:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308736431] [2025-03-09 06:38:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:38:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:49,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:38:49,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:38:49,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:49,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:49,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:49,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:49,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:49,694 INFO L124 PetriNetUnfolderBase]: 4136/8025 cut-off events. [2025-03-09 06:38:49,694 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-09 06:38:49,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13722 conditions, 8025 events. 4136/8025 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 65997 event pairs, 2732 based on Foata normal form. 1/6391 useless extension candidates. Maximal degree in co-relation 13710. Up to 5505 conditions per place. [2025-03-09 06:38:49,728 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-03-09 06:38:49,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 129 transitions, 503 flow [2025-03-09 06:38:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:38:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:38:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-09 06:38:49,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-09 06:38:49,730 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 369 flow. Second operand 3 states and 284 transitions. [2025-03-09 06:38:49,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 129 transitions, 503 flow [2025-03-09 06:38:49,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 458 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-09 06:38:49,732 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 322 flow [2025-03-09 06:38:49,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-03-09 06:38:49,733 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-03-09 06:38:49,733 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 322 flow [2025-03-09 06:38:49,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:49,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:49,733 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:38:49,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:38:49,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:49,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1393986501, now seen corresponding path program 1 times [2025-03-09 06:38:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705944713] [2025-03-09 06:38:49,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:49,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:38:49,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:38:49,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:49,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:49,796 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-09 06:38:49,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705944713] [2025-03-09 06:38:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705944713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214223870] [2025-03-09 06:38:49,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:49,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:49,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:49,799 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-09 06:38:49,801 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-09 06:38:49,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:38:49,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:38:49,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:49,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:49,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:38:49,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:49,887 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-09 06:38:49,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:49,917 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-09 06:38:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214223870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:49,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:49,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 06:38:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839801308] [2025-03-09 06:38:49,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:49,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:38:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:49,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:38:49,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:38:49,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:38:49,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 322 flow. Second operand has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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-09 06:38:49,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:49,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:38:49,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:50,508 INFO L124 PetriNetUnfolderBase]: 4145/8061 cut-off events. [2025-03-09 06:38:50,508 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-09 06:38:50,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13791 conditions, 8061 events. 4145/8061 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66194 event pairs, 2732 based on Foata normal form. 9/6426 useless extension candidates. Maximal degree in co-relation 13779. Up to 5512 conditions per place. [2025-03-09 06:38:50,547 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 60 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2025-03-09 06:38:50,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 637 flow [2025-03-09 06:38:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:38:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:38:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-03-09 06:38:50,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-09 06:38:50,553 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 322 flow. Second operand 10 states and 828 transitions. [2025-03-09 06:38:50,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 637 flow [2025-03-09 06:38:50,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 156 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:50,560 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 570 flow [2025-03-09 06:38:50,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=570, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2025-03-09 06:38:50,561 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-09 06:38:50,561 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 570 flow [2025-03-09 06:38:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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-09 06:38:50,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:50,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:50,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:38:50,765 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,SelfDestructingSolverStorable8 [2025-03-09 06:38:50,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:50,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1679102714, now seen corresponding path program 1 times [2025-03-09 06:38:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998402529] [2025-03-09 06:38:50,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:50,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:38:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:38:50,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:50,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:50,831 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-09 06:38:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998402529] [2025-03-09 06:38:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998402529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247563220] [2025-03-09 06:38:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:50,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:50,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:50,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:50,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:38:50,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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-09 06:38:50,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:50,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:38:50,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:51,319 INFO L124 PetriNetUnfolderBase]: 4148/8073 cut-off events. [2025-03-09 06:38:51,320 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-09 06:38:51,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 8073 events. 4148/8073 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66257 event pairs, 2732 based on Foata normal form. 3/6438 useless extension candidates. Maximal degree in co-relation 13869. Up to 5542 conditions per place. [2025-03-09 06:38:51,347 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 99 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2025-03-09 06:38:51,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 165 transitions, 810 flow [2025-03-09 06:38:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-09 06:38:51,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-03-09 06:38:51,349 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 570 flow. Second operand 4 states and 369 transitions. [2025-03-09 06:38:51,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 165 transitions, 810 flow [2025-03-09 06:38:51,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 165 transitions, 777 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-09 06:38:51,352 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 624 flow [2025-03-09 06:38:51,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=136, PETRI_TRANSITIONS=165} [2025-03-09 06:38:51,353 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-03-09 06:38:51,353 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 624 flow [2025-03-09 06:38:51,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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-09 06:38:51,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:51,353 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:51,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:38:51,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:51,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1336431265, now seen corresponding path program 1 times [2025-03-09 06:38:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98674607] [2025-03-09 06:38:51,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:51,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:38:51,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:38:51,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:51,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:38:51,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98674607] [2025-03-09 06:38:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98674607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:51,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:51,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895168969] [2025-03-09 06:38:51,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:51,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:51,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:51,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:51,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:51,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 165 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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-09 06:38:51,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:51,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:51,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:51,877 INFO L124 PetriNetUnfolderBase]: 4147/8072 cut-off events. [2025-03-09 06:38:51,877 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-03-09 06:38:51,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13899 conditions, 8072 events. 4147/8072 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66224 event pairs, 2732 based on Foata normal form. 1/6441 useless extension candidates. Maximal degree in co-relation 13881. Up to 5538 conditions per place. [2025-03-09 06:38:51,920 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 101 selfloop transitions, 3 changer transitions 0/164 dead transitions. [2025-03-09 06:38:51,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 164 transitions, 828 flow [2025-03-09 06:38:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-09 06:38:51,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-09 06:38:51,922 INFO L175 Difference]: Start difference. First operand has 136 places, 165 transitions, 624 flow. Second operand 4 states and 359 transitions. [2025-03-09 06:38:51,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 164 transitions, 828 flow [2025-03-09 06:38:51,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:51,925 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 617 flow [2025-03-09 06:38:51,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=138, PETRI_TRANSITIONS=164} [2025-03-09 06:38:51,926 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places. [2025-03-09 06:38:51,926 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 617 flow [2025-03-09 06:38:51,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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-09 06:38:51,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:51,926 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-09 06:38:51,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:38:51,927 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1102149261, now seen corresponding path program 2 times [2025-03-09 06:38:51,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:51,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124314665] [2025-03-09 06:38:51,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:38:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:51,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:38:51,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 06:38:51,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:38:51,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:51,976 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-09 06:38:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124314665] [2025-03-09 06:38:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124314665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482512552] [2025-03-09 06:38:51,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:38:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:51,979 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-09 06:38:51,981 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-09 06:38:52,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 06:38:52,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 06:38:52,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:38:52,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:52,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:38:52,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:52,067 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-09 06:38:52,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:52,096 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-09 06:38:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482512552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:52,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:52,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-09 06:38:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671499279] [2025-03-09 06:38:52,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:52,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:38:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:52,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:38:52,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:38:52,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-03-09 06:38:52,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 164 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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-09 06:38:52,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:52,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-03-09 06:38:52,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:52,627 INFO L124 PetriNetUnfolderBase]: 4147/8069 cut-off events. [2025-03-09 06:38:52,627 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-03-09 06:38:52,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13881 conditions, 8069 events. 4147/8069 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66145 event pairs, 2732 based on Foata normal form. 3/6440 useless extension candidates. Maximal degree in co-relation 13862. Up to 5507 conditions per place. [2025-03-09 06:38:52,666 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 56 selfloop transitions, 48 changer transitions 0/161 dead transitions. [2025-03-09 06:38:52,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 795 flow [2025-03-09 06:38:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:38:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:38:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-03-09 06:38:52,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-03-09 06:38:52,668 INFO L175 Difference]: Start difference. First operand has 138 places, 164 transitions, 617 flow. Second operand 5 states and 403 transitions. [2025-03-09 06:38:52,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 795 flow [2025-03-09 06:38:52,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 161 transitions, 761 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:38:52,670 INFO L231 Difference]: Finished difference. Result has 133 places, 161 transitions, 649 flow [2025-03-09 06:38:52,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=649, PETRI_PLACES=133, PETRI_TRANSITIONS=161} [2025-03-09 06:38:52,671 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-09 06:38:52,671 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 161 transitions, 649 flow [2025-03-09 06:38:52,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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-09 06:38:52,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:52,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:52,677 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-09 06:38:52,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:52,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:52,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2062744359, now seen corresponding path program 1 times [2025-03-09 06:38:52,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:52,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763573805] [2025-03-09 06:38:52,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:52,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:52,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:38:52,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:38:52,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:52,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:38:52,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:52,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763573805] [2025-03-09 06:38:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763573805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:52,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397347608] [2025-03-09 06:38:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:52,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:52,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:52,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:52,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:52,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 161 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-09 06:38:52,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:52,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:52,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:53,536 INFO L124 PetriNetUnfolderBase]: 4146/8068 cut-off events. [2025-03-09 06:38:53,536 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-09 06:38:53,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13904 conditions, 8068 events. 4146/8068 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66190 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13889. Up to 5537 conditions per place. [2025-03-09 06:38:53,573 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 100 selfloop transitions, 3 changer transitions 0/160 dead transitions. [2025-03-09 06:38:53,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 849 flow [2025-03-09 06:38:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-09 06:38:53,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-09 06:38:53,576 INFO L175 Difference]: Start difference. First operand has 133 places, 161 transitions, 649 flow. Second operand 4 states and 359 transitions. [2025-03-09 06:38:53,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 849 flow [2025-03-09 06:38:53,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 755 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:38:53,579 INFO L231 Difference]: Finished difference. Result has 132 places, 160 transitions, 555 flow [2025-03-09 06:38:53,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=132, PETRI_TRANSITIONS=160} [2025-03-09 06:38:53,580 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-09 06:38:53,580 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 160 transitions, 555 flow [2025-03-09 06:38:53,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-09 06:38:53,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:53,581 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:53,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:38:53,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:53,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:53,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1586243387, now seen corresponding path program 1 times [2025-03-09 06:38:53,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:53,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714020760] [2025-03-09 06:38:53,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:53,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:53,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:38:53,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:38:53,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:53,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:38:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:53,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714020760] [2025-03-09 06:38:53,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714020760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:53,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:53,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406217217] [2025-03-09 06:38:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:53,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:53,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:53,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:53,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:38:53,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 160 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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-09 06:38:53,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:53,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:38:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:54,208 INFO L124 PetriNetUnfolderBase]: 4145/8067 cut-off events. [2025-03-09 06:38:54,208 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-09 06:38:54,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 8067 events. 4145/8067 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66136 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13842. Up to 5536 conditions per place. [2025-03-09 06:38:54,244 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 99 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2025-03-09 06:38:54,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 159 transitions, 755 flow [2025-03-09 06:38:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-09 06:38:54,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-09 06:38:54,246 INFO L175 Difference]: Start difference. First operand has 132 places, 160 transitions, 555 flow. Second operand 4 states and 359 transitions. [2025-03-09 06:38:54,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 159 transitions, 755 flow [2025-03-09 06:38:54,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 159 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:38:54,248 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 553 flow [2025-03-09 06:38:54,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2025-03-09 06:38:54,248 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-09 06:38:54,248 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 553 flow [2025-03-09 06:38:54,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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-09 06:38:54,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:54,249 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:54,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:38:54,249 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:54,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1630588568, now seen corresponding path program 1 times [2025-03-09 06:38:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-03-09 06:38:54,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:38:54,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:38:54,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:54,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:38:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-03-09 06:38:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549871659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130870248] [2025-03-09 06:38:54,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:54,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:54,337 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-09 06:38:54,339 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-09 06:38:54,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:38:54,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:38:54,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:54,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:54,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:38:54,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:38:54,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:38:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130870248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:54,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 06:38:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041694815] [2025-03-09 06:38:54,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:54,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:38:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:54,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:38:54,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:38:54,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 140 [2025-03-09 06:38:54,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 553 flow. Second operand has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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-09 06:38:54,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:54,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 140 [2025-03-09 06:38:54,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:56,352 INFO L124 PetriNetUnfolderBase]: 8284/16102 cut-off events. [2025-03-09 06:38:56,353 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-03-09 06:38:56,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 16102 events. 8284/16102 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 146499 event pairs, 5464 based on Foata normal form. 5/12948 useless extension candidates. Maximal degree in co-relation 27609. Up to 5508 conditions per place. [2025-03-09 06:38:56,457 INFO L140 encePairwiseOnDemand]: 117/140 looper letters, 120 selfloop transitions, 71 changer transitions 0/242 dead transitions. [2025-03-09 06:38:56,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 242 transitions, 1257 flow [2025-03-09 06:38:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:38:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 06:38:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1263 transitions. [2025-03-09 06:38:56,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5011904761904762 [2025-03-09 06:38:56,460 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 553 flow. Second operand 18 states and 1263 transitions. [2025-03-09 06:38:56,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 242 transitions, 1257 flow [2025-03-09 06:38:56,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 242 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:38:56,464 INFO L231 Difference]: Finished difference. Result has 147 places, 195 transitions, 980 flow [2025-03-09 06:38:56,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=980, PETRI_PLACES=147, PETRI_TRANSITIONS=195} [2025-03-09 06:38:56,465 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2025-03-09 06:38:56,465 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 195 transitions, 980 flow [2025-03-09 06:38:56,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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-09 06:38:56,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:56,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:56,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:38:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 06:38:56,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:56,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash 597579185, now seen corresponding path program 1 times [2025-03-09 06:38:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672091734] [2025-03-09 06:38:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:56,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:38:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:38:56,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:56,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:38:56,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672091734] [2025-03-09 06:38:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672091734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403463320] [2025-03-09 06:38:56,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:56,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:56,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:56,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:56,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:38:56,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:38:56,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:38:56,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:56,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:56,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:38:56,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:38:56,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:38:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403463320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:56,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 06:38:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255792636] [2025-03-09 06:38:56,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:38:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:56,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:38:56,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:38:56,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:38:56,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 195 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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-09 06:38:56,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:56,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:38:56,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:58,001 INFO L124 PetriNetUnfolderBase]: 8299/16162 cut-off events. [2025-03-09 06:38:58,002 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-03-09 06:38:58,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27938 conditions, 16162 events. 8299/16162 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 147460 event pairs, 5464 based on Foata normal form. 15/12917 useless extension candidates. Maximal degree in co-relation 27923. Up to 11066 conditions per place. [2025-03-09 06:38:58,081 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 119 selfloop transitions, 70 changer transitions 0/240 dead transitions. [2025-03-09 06:38:58,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 240 transitions, 1637 flow [2025-03-09 06:38:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:38:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:38:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-03-09 06:38:58,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-09 06:38:58,083 INFO L175 Difference]: Start difference. First operand has 147 places, 195 transitions, 980 flow. Second operand 10 states and 828 transitions. [2025-03-09 06:38:58,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 240 transitions, 1637 flow [2025-03-09 06:38:58,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 240 transitions, 1505 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-03-09 06:38:58,088 INFO L231 Difference]: Finished difference. Result has 155 places, 240 transitions, 1345 flow [2025-03-09 06:38:58,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1345, PETRI_PLACES=155, PETRI_TRANSITIONS=240} [2025-03-09 06:38:58,088 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 25 predicate places. [2025-03-09 06:38:58,088 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 240 transitions, 1345 flow [2025-03-09 06:38:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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-09 06:38:58,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:58,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:58,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:38:58,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:38:58,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:38:58,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2069066906, now seen corresponding path program 1 times [2025-03-09 06:38:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672025782] [2025-03-09 06:38:58,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:58,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 06:38:58,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:38:58,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:58,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:38:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672025782] [2025-03-09 06:38:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672025782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346586067] [2025-03-09 06:38:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:58,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:58,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:58,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:58,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:38:58,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 240 transitions, 1345 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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-09 06:38:58,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:58,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:38:58,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:00,034 INFO L124 PetriNetUnfolderBase]: 16161/28622 cut-off events. [2025-03-09 06:39:00,034 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-03-09 06:39:00,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51221 conditions, 28622 events. 16161/28622 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 259243 event pairs, 4946 based on Foata normal form. 728/24000 useless extension candidates. Maximal degree in co-relation 51203. Up to 10192 conditions per place. [2025-03-09 06:39:00,242 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 236 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-03-09 06:39:00,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 289 transitions, 1931 flow [2025-03-09 06:39:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-03-09 06:39:00,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-09 06:39:00,244 INFO L175 Difference]: Start difference. First operand has 155 places, 240 transitions, 1345 flow. Second operand 4 states and 406 transitions. [2025-03-09 06:39:00,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 289 transitions, 1931 flow [2025-03-09 06:39:00,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 289 transitions, 1871 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:00,249 INFO L231 Difference]: Finished difference. Result has 158 places, 242 transitions, 1319 flow [2025-03-09 06:39:00,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1319, PETRI_PLACES=158, PETRI_TRANSITIONS=242} [2025-03-09 06:39:00,249 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 28 predicate places. [2025-03-09 06:39:00,249 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 242 transitions, 1319 flow [2025-03-09 06:39:00,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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-09 06:39:00,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:00,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:39:00,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 283436674, now seen corresponding path program 1 times [2025-03-09 06:39:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468824238] [2025-03-09 06:39:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:00,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:39:00,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:39:00,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:00,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:39:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468824238] [2025-03-09 06:39:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468824238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475941743] [2025-03-09 06:39:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:00,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:00,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:00,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:39:00,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 242 transitions, 1319 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-09 06:39:00,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:00,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:39:00,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:01,592 INFO L124 PetriNetUnfolderBase]: 10387/20680 cut-off events. [2025-03-09 06:39:01,593 INFO L125 PetriNetUnfolderBase]: For 4063/4595 co-relation queries the response was YES. [2025-03-09 06:39:01,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38331 conditions, 20680 events. 10387/20680 cut-off events. For 4063/4595 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 199695 event pairs, 7008 based on Foata normal form. 272/17108 useless extension candidates. Maximal degree in co-relation 38310. Up to 13915 conditions per place. [2025-03-09 06:39:01,737 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 181 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2025-03-09 06:39:01,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 240 transitions, 1680 flow [2025-03-09 06:39:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-09 06:39:01,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-09 06:39:01,739 INFO L175 Difference]: Start difference. First operand has 158 places, 242 transitions, 1319 flow. Second operand 4 states and 359 transitions. [2025-03-09 06:39:01,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 240 transitions, 1680 flow [2025-03-09 06:39:01,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 240 transitions, 1680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:39:01,748 INFO L231 Difference]: Finished difference. Result has 161 places, 240 transitions, 1318 flow [2025-03-09 06:39:01,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1318, PETRI_PLACES=161, PETRI_TRANSITIONS=240} [2025-03-09 06:39:01,748 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 31 predicate places. [2025-03-09 06:39:01,749 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 240 transitions, 1318 flow [2025-03-09 06:39:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-09 06:39:01,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:01,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:01,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:39:01,749 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1262756025, now seen corresponding path program 1 times [2025-03-09 06:39:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-03-09 06:39:01,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:01,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:39:01,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:39:01,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:01,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:01,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:01,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-03-09 06:39:01,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097997250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:01,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:01,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:01,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218647737] [2025-03-09 06:39:01,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:01,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:01,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:01,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:01,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:01,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:39:01,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 240 transitions, 1318 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:01,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:01,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:39:01,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:03,346 INFO L124 PetriNetUnfolderBase]: 10385/20678 cut-off events. [2025-03-09 06:39:03,346 INFO L125 PetriNetUnfolderBase]: For 4073/4605 co-relation queries the response was YES. [2025-03-09 06:39:03,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38329 conditions, 20678 events. 10385/20678 cut-off events. For 4073/4605 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 199470 event pairs, 7008 based on Foata normal form. 272/17106 useless extension candidates. Maximal degree in co-relation 38306. Up to 13913 conditions per place. [2025-03-09 06:39:03,489 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 179 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2025-03-09 06:39:03,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 238 transitions, 1675 flow [2025-03-09 06:39:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-09 06:39:03,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-09 06:39:03,491 INFO L175 Difference]: Start difference. First operand has 161 places, 240 transitions, 1318 flow. Second operand 4 states and 359 transitions. [2025-03-09 06:39:03,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 238 transitions, 1675 flow [2025-03-09 06:39:03,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 238 transitions, 1669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:03,502 INFO L231 Difference]: Finished difference. Result has 162 places, 238 transitions, 1311 flow [2025-03-09 06:39:03,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1311, PETRI_PLACES=162, PETRI_TRANSITIONS=238} [2025-03-09 06:39:03,503 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 32 predicate places. [2025-03-09 06:39:03,503 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 238 transitions, 1311 flow [2025-03-09 06:39:03,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:03,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:03,503 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:39:03,504 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -851848566, now seen corresponding path program 2 times [2025-03-09 06:39:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945868151] [2025-03-09 06:39:03,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:03,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-09 06:39:03,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-03-09 06:39:03,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:03,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 06:39:03,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945868151] [2025-03-09 06:39:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945868151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509785143] [2025-03-09 06:39:03,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:03,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:03,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:03,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:03,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:39:03,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-09 06:39:03,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-03-09 06:39:03,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:03,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:39:03,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 06:39:03,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 06:39:03,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509785143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:03,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-03-09 06:39:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039528367] [2025-03-09 06:39:03,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:03,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:03,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:03,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:03,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-03-09 06:39:03,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 238 transitions, 1311 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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-09 06:39:03,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:03,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-03-09 06:39:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:05,437 INFO L124 PetriNetUnfolderBase]: 10385/20673 cut-off events. [2025-03-09 06:39:05,437 INFO L125 PetriNetUnfolderBase]: For 4097/4629 co-relation queries the response was YES. [2025-03-09 06:39:05,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38306 conditions, 20673 events. 10385/20673 cut-off events. For 4097/4629 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 199464 event pairs, 7008 based on Foata normal form. 275/17104 useless extension candidates. Maximal degree in co-relation 38283. Up to 13859 conditions per place. [2025-03-09 06:39:05,624 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 102 selfloop transitions, 82 changer transitions 0/235 dead transitions. [2025-03-09 06:39:05,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 235 transitions, 1649 flow [2025-03-09 06:39:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-03-09 06:39:05,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-03-09 06:39:05,626 INFO L175 Difference]: Start difference. First operand has 162 places, 238 transitions, 1311 flow. Second operand 5 states and 403 transitions. [2025-03-09 06:39:05,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 235 transitions, 1649 flow [2025-03-09 06:39:05,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 235 transitions, 1591 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-09 06:39:05,639 INFO L231 Difference]: Finished difference. Result has 157 places, 235 transitions, 1387 flow [2025-03-09 06:39:05,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1387, PETRI_PLACES=157, PETRI_TRANSITIONS=235} [2025-03-09 06:39:05,640 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 27 predicate places. [2025-03-09 06:39:05,640 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 235 transitions, 1387 flow [2025-03-09 06:39:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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-09 06:39:05,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:05,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:05,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:39:05,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:05,840 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:05,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1534183395, now seen corresponding path program 1 times [2025-03-09 06:39:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:05,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505994106] [2025-03-09 06:39:05,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:05,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:39:05,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:39:05,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:05,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505994106] [2025-03-09 06:39:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505994106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717982211] [2025-03-09 06:39:06,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:06,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:06,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:06,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:39:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:39:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:39:06,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:06,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:06,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:06,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:39:06,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:39:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717982211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:06,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:39:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-09 06:39:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362427900] [2025-03-09 06:39:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:06,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:06,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:06,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:39:06,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-09 06:39:06,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 235 transitions, 1387 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-09 06:39:06,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:06,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-09 06:39:06,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:07,677 INFO L124 PetriNetUnfolderBase]: 10383/20671 cut-off events. [2025-03-09 06:39:07,678 INFO L125 PetriNetUnfolderBase]: For 4120/4652 co-relation queries the response was YES. [2025-03-09 06:39:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38345 conditions, 20671 events. 10383/20671 cut-off events. For 4120/4652 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 199257 event pairs, 7008 based on Foata normal form. 271/17092 useless extension candidates. Maximal degree in co-relation 38326. Up to 13911 conditions per place. [2025-03-09 06:39:07,875 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 177 selfloop transitions, 5 changer transitions 0/233 dead transitions. [2025-03-09 06:39:07,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 233 transitions, 1736 flow [2025-03-09 06:39:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-09 06:39:07,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-09 06:39:07,876 INFO L175 Difference]: Start difference. First operand has 157 places, 235 transitions, 1387 flow. Second operand 4 states and 359 transitions. [2025-03-09 06:39:07,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 233 transitions, 1736 flow [2025-03-09 06:39:07,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 1576 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:39:07,895 INFO L231 Difference]: Finished difference. Result has 156 places, 233 transitions, 1222 flow [2025-03-09 06:39:07,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1222, PETRI_PLACES=156, PETRI_TRANSITIONS=233} [2025-03-09 06:39:07,895 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 26 predicate places. [2025-03-09 06:39:07,895 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 233 transitions, 1222 flow [2025-03-09 06:39:07,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-09 06:39:07,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:07,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:07,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:39:08,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:08,100 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash -276783272, now seen corresponding path program 1 times [2025-03-09 06:39:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-09 06:39:08,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:08,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 06:39:08,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 06:39:08,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:08,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:08,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:08,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-09 06:39:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762076163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:08,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322980035] [2025-03-09 06:39:08,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:08,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:08,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:39:08,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 06:39:08,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 06:39:08,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:08,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:08,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:39:08,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:09,026 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-03-09 06:39:09,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 06:39:09,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:39:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:39:09,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:39:09,598 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 06:39:09,598 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 23 treesize of output 10 [2025-03-09 06:39:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:09,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:09,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:39:09,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-09 06:39:09,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:39:09,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-09 06:39:09,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-09 06:39:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322980035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:09,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 06:39:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949401269] [2025-03-09 06:39:09,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:09,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:39:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:09,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:39:09,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=415, Unknown=6, NotChecked=0, Total=506 [2025-03-09 06:39:10,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-03-09 06:39:10,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 233 transitions, 1222 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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-09 06:39:10,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:10,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-03-09 06:39:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:11,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((v_ArrVal_396 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_396) c_~get_5~0.base) .cse0) 9223372039002259456)) (<= 0 c_~id_3~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_159| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_159|) 0)) (forall ((v_ArrVal_396 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_159| v_ArrVal_396) c_~get_5~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-03-09 06:39:15,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:39:25,454 INFO L124 PetriNetUnfolderBase]: 77793/118511 cut-off events. [2025-03-09 06:39:25,454 INFO L125 PetriNetUnfolderBase]: For 11864/12306 co-relation queries the response was YES. [2025-03-09 06:39:25,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241689 conditions, 118511 events. 77793/118511 cut-off events. For 11864/12306 co-relation queries the response was YES. Maximal size of possible extension queue 5116. Compared 1016104 event pairs, 17482 based on Foata normal form. 442/104225 useless extension candidates. Maximal degree in co-relation 241670. Up to 24786 conditions per place. [2025-03-09 06:39:26,404 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 524 selfloop transitions, 108 changer transitions 0/669 dead transitions. [2025-03-09 06:39:26,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 669 transitions, 4389 flow [2025-03-09 06:39:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:39:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 06:39:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1533 transitions. [2025-03-09 06:39:26,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2025-03-09 06:39:26,407 INFO L175 Difference]: Start difference. First operand has 156 places, 233 transitions, 1222 flow. Second operand 22 states and 1533 transitions. [2025-03-09 06:39:26,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 669 transitions, 4389 flow [2025-03-09 06:39:26,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 669 transitions, 4375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:26,840 INFO L231 Difference]: Finished difference. Result has 180 places, 292 transitions, 1993 flow [2025-03-09 06:39:26,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1993, PETRI_PLACES=180, PETRI_TRANSITIONS=292} [2025-03-09 06:39:26,840 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 50 predicate places. [2025-03-09 06:39:26,840 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 292 transitions, 1993 flow [2025-03-09 06:39:26,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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-09 06:39:26,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:26,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:26,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 06:39:27,042 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:27,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1015563304, now seen corresponding path program 1 times [2025-03-09 06:39:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90156080] [2025-03-09 06:39:27,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:27,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:27,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:39:27,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:39:27,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:27,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:39:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90156080] [2025-03-09 06:39:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90156080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805048908] [2025-03-09 06:39:27,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:27,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:27,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:27,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:27,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-09 06:39:27,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 292 transitions, 1993 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:27,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:27,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-09 06:39:27,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:36,542 INFO L124 PetriNetUnfolderBase]: 65461/115971 cut-off events. [2025-03-09 06:39:36,542 INFO L125 PetriNetUnfolderBase]: For 57588/61500 co-relation queries the response was YES. [2025-03-09 06:39:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242470 conditions, 115971 events. 65461/115971 cut-off events. For 57588/61500 co-relation queries the response was YES. Maximal size of possible extension queue 5697. Compared 1227906 event pairs, 22082 based on Foata normal form. 4402/102177 useless extension candidates. Maximal degree in co-relation 242446. Up to 42378 conditions per place. [2025-03-09 06:39:37,786 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 313 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-03-09 06:39:37,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 365 transitions, 2959 flow [2025-03-09 06:39:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-03-09 06:39:37,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-03-09 06:39:37,788 INFO L175 Difference]: Start difference. First operand has 180 places, 292 transitions, 1993 flow. Second operand 4 states and 404 transitions. [2025-03-09 06:39:37,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 365 transitions, 2959 flow [2025-03-09 06:39:38,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 365 transitions, 2943 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:38,015 INFO L231 Difference]: Finished difference. Result has 183 places, 294 transitions, 2019 flow [2025-03-09 06:39:38,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2019, PETRI_PLACES=183, PETRI_TRANSITIONS=294} [2025-03-09 06:39:38,016 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 53 predicate places. [2025-03-09 06:39:38,016 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 294 transitions, 2019 flow [2025-03-09 06:39:38,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:38,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 06:39:38,017 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-09 06:39:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 9623732, now seen corresponding path program 1 times [2025-03-09 06:39:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680408214] [2025-03-09 06:39:38,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:38,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:39:38,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:39:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680408214] [2025-03-09 06:39:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680408214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626263307] [2025-03-09 06:39:38,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:38,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:38,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:39:38,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:39:38,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:39:38,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:38,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:38,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 06:39:38,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:38,772 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-03-09 06:39:38,806 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-09 06:39:38,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:39:38,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:39:38,947 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-03-09 06:39:39,068 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-03-09 06:39:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:39:39,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:39,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_471 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_471) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset))))) is different from false [2025-03-09 06:39:39,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:39:39,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-09 06:39:39,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:39:39,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-09 06:39:39,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-09 06:39:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2025-03-09 06:39:39,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626263307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:39,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 06:39:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621759583] [2025-03-09 06:39:39,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:39:39,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:39,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:39:39,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2025-03-09 06:39:39,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-03-09 06:39:39,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 294 transitions, 2019 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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-09 06:39:39,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:39,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-03-09 06:39:39,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:40,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| Int)) (or (forall ((v_ArrVal_471 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| v_ArrVal_471) c_~get_5~0.base) .cse0) 4294967296))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163|) 0)))) (<= 0 c_~id_3~0) (forall ((v_ArrVal_471 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_471) c_~get_5~0.base) .cse0)))))) is different from false [2025-03-09 06:39:44,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]