./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -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 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:23:40,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:23:40,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:23:40,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:23:40,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:23:40,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:23:40,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:23:40,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:23:40,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:23:40,602 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:23:40,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:23:40,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:23:40,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:23:40,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:23:40,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:23:40,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:23:40,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:40,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:23:40,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:23:40,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:23:40,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:23:40,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:23:40,607 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 -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2025-03-04 15:23:40,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:23:40,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:23:40,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:23:40,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:23:40,859 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:23:40,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-04 15:23:42,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503847469/63924b1e153b45f3b87bf72ba0af17b3/FLAGbbe96f5b5 [2025-03-04 15:23:42,343 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:23:42,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-04 15:23:42,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503847469/63924b1e153b45f3b87bf72ba0af17b3/FLAGbbe96f5b5 [2025-03-04 15:23:42,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503847469/63924b1e153b45f3b87bf72ba0af17b3 [2025-03-04 15:23:42,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:23:42,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:23:42,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:42,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:23:42,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:23:42,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:42" (1/1) ... [2025-03-04 15:23:42,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf71a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:42, skipping insertion in model container [2025-03-04 15:23:42,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:42" (1/1) ... [2025-03-04 15:23:42,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:23:42,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:42,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:23:42,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:43,003 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:23:43,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43 WrapperNode [2025-03-04 15:23:43,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:43,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:43,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:23:43,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:23:43,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,045 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 196 [2025-03-04 15:23:43,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:43,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:23:43,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:23:43,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:23:43,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,075 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-04 15:23:43,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:23:43,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:23:43,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:23:43,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:23:43,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (1/1) ... [2025-03-04 15:23:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:43,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:23:43,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:23:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:23:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:23:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:23:43,142 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:23:43,235 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:23:43,238 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:43,487 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:43,487 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:43,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:43,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:43,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:43 BoogieIcfgContainer [2025-03-04 15:23:43,668 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:43,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:43,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:43,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:43,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:23:42" (1/3) ... [2025-03-04 15:23:43,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cae609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:43, skipping insertion in model container [2025-03-04 15:23:43,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:43" (2/3) ... [2025-03-04 15:23:43,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cae609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:43, skipping insertion in model container [2025-03-04 15:23:43,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:43" (3/3) ... [2025-03-04 15:23:43,678 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-04 15:23:43,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:43,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 70 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 15:23:43,689 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:43,737 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:23:43,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 154 flow [2025-03-04 15:23:43,795 INFO L124 PetriNetUnfolderBase]: 5/75 cut-off events. [2025-03-04 15:23:43,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:43,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 75 events. 5/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 149 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2025-03-04 15:23:43,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 75 transitions, 154 flow [2025-03-04 15:23:43,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 73 transitions, 149 flow [2025-03-04 15:23:43,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:43,825 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;@49c787ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:43,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:23:43,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:43,834 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-03-04 15:23:43,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:43,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:43,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:43,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:43,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1068039055, now seen corresponding path program 1 times [2025-03-04 15:23:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560479223] [2025-03-04 15:23:43,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:43,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:43,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:43,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560479223] [2025-03-04 15:23:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560479223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732276824] [2025-03-04 15:23:44,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:44,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:44,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:44,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:44,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 15:23:44,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:44,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:44,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 15:23:44,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:44,443 INFO L124 PetriNetUnfolderBase]: 354/960 cut-off events. [2025-03-04 15:23:44,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:44,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 960 events. 354/960 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5548 event pairs, 220 based on Foata normal form. 51/914 useless extension candidates. Maximal degree in co-relation 1623. Up to 507 conditions per place. [2025-03-04 15:23:44,449 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 52 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-04 15:23:44,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 283 flow [2025-03-04 15:23:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-03-04 15:23:44,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-03-04 15:23:44,461 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 149 flow. Second operand 3 states and 159 transitions. [2025-03-04 15:23:44,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 283 flow [2025-03-04 15:23:44,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:44,468 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 146 flow [2025-03-04 15:23:44,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2025-03-04 15:23:44,473 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-03-04 15:23:44,474 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 146 flow [2025-03-04 15:23:44,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:44,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:44,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:44,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:44,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:44,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1250527204, now seen corresponding path program 1 times [2025-03-04 15:23:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876796229] [2025-03-04 15:23:44,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:44,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:23:44,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:23:44,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:44,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876796229] [2025-03-04 15:23:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876796229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242422158] [2025-03-04 15:23:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:44,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:44,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:44,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:44,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 15:23:44,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:44,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:44,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 15:23:44,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:44,719 INFO L124 PetriNetUnfolderBase]: 335/924 cut-off events. [2025-03-04 15:23:44,720 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:23:44,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 924 events. 335/924 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5325 event pairs, 218 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1583. Up to 507 conditions per place. [2025-03-04 15:23:44,724 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 51 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-04 15:23:44,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 282 flow [2025-03-04 15:23:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-04 15:23:44,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-03-04 15:23:44,725 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 146 flow. Second operand 3 states and 156 transitions. [2025-03-04 15:23:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 282 flow [2025-03-04 15:23:44,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:44,727 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 144 flow [2025-03-04 15:23:44,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2025-03-04 15:23:44,728 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-04 15:23:44,728 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 144 flow [2025-03-04 15:23:44,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:44,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:44,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:44,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:23:44,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:44,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash 832006604, now seen corresponding path program 1 times [2025-03-04 15:23:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116352062] [2025-03-04 15:23:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:44,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:23:44,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:23:44,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:44,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:44,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116352062] [2025-03-04 15:23:44,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116352062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:44,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:44,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584396437] [2025-03-04 15:23:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:44,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:44,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:44,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 15:23:44,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:44,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:44,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 15:23:44,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:44,979 INFO L124 PetriNetUnfolderBase]: 348/929 cut-off events. [2025-03-04 15:23:44,979 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 15:23:44,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 929 events. 348/929 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5206 event pairs, 258 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1625. Up to 603 conditions per place. [2025-03-04 15:23:44,983 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 52 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-04 15:23:44,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 282 flow [2025-03-04 15:23:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-03-04 15:23:44,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-03-04 15:23:44,985 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 144 flow. Second operand 3 states and 160 transitions. [2025-03-04 15:23:44,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 282 flow [2025-03-04 15:23:44,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:44,986 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 142 flow [2025-03-04 15:23:44,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2025-03-04 15:23:44,987 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-04 15:23:44,987 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 142 flow [2025-03-04 15:23:44,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:44,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:44,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:23:44,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1476868444, now seen corresponding path program 1 times [2025-03-04 15:23:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749523430] [2025-03-04 15:23:44,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:44,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:44,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:23:45,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:23:45,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:45,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749523430] [2025-03-04 15:23:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749523430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356755464] [2025-03-04 15:23:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:45,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:45,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:45,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-03-04 15:23:45,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:45,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-03-04 15:23:45,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:45,280 INFO L124 PetriNetUnfolderBase]: 392/980 cut-off events. [2025-03-04 15:23:45,281 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:23:45,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 980 events. 392/980 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5498 event pairs, 218 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1762. Up to 507 conditions per place. [2025-03-04 15:23:45,285 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 69 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-03-04 15:23:45,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 348 flow [2025-03-04 15:23:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-03-04 15:23:45,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.67 [2025-03-04 15:23:45,289 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 142 flow. Second operand 4 states and 201 transitions. [2025-03-04 15:23:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 348 flow [2025-03-04 15:23:45,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:45,292 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 142 flow [2025-03-04 15:23:45,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-03-04 15:23:45,293 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-04 15:23:45,293 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 142 flow [2025-03-04 15:23:45,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:45,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:23:45,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1476867529, now seen corresponding path program 1 times [2025-03-04 15:23:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721494471] [2025-03-04 15:23:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:45,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:23:45,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:23:45,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:45,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721494471] [2025-03-04 15:23:45,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721494471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:45,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:23:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160130568] [2025-03-04 15:23:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:45,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:45,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:45,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-03-04 15:23:45,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:45,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-03-04 15:23:45,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:45,563 INFO L124 PetriNetUnfolderBase]: 373/910 cut-off events. [2025-03-04 15:23:45,563 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:23:45,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 910 events. 373/910 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4879 event pairs, 220 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1673. Up to 507 conditions per place. [2025-03-04 15:23:45,567 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 67 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-03-04 15:23:45,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 342 flow [2025-03-04 15:23:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-03-04 15:23:45,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2025-03-04 15:23:45,568 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 142 flow. Second operand 4 states and 188 transitions. [2025-03-04 15:23:45,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 342 flow [2025-03-04 15:23:45,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:45,570 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 138 flow [2025-03-04 15:23:45,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-03-04 15:23:45,570 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2025-03-04 15:23:45,570 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 138 flow [2025-03-04 15:23:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:45,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:23:45,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:45,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash 486921342, now seen corresponding path program 1 times [2025-03-04 15:23:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541615260] [2025-03-04 15:23:45,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:45,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:23:45,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:23:45,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541615260] [2025-03-04 15:23:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541615260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290411869] [2025-03-04 15:23:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:45,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:45,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:45,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 15:23:45,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:45,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 15:23:45,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:45,757 INFO L124 PetriNetUnfolderBase]: 317/814 cut-off events. [2025-03-04 15:23:45,757 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 15:23:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 814 events. 317/814 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4249 event pairs, 243 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1503. Up to 558 conditions per place. [2025-03-04 15:23:45,760 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 53 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-04 15:23:45,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 282 flow [2025-03-04 15:23:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-03-04 15:23:45,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7155555555555555 [2025-03-04 15:23:45,761 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 138 flow. Second operand 3 states and 161 transitions. [2025-03-04 15:23:45,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 282 flow [2025-03-04 15:23:45,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:45,763 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 124 flow [2025-03-04 15:23:45,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-04 15:23:45,763 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-03-04 15:23:45,763 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 124 flow [2025-03-04 15:23:45,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:45,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:45,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:23:45,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:45,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1461718941, now seen corresponding path program 1 times [2025-03-04 15:23:45,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:45,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686459423] [2025-03-04 15:23:45,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:45,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:45,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:23:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:23:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:45,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686459423] [2025-03-04 15:23:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686459423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259438837] [2025-03-04 15:23:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:45,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:45,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:45,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:45,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-03-04 15:23:45,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:45,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:45,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-03-04 15:23:45,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:46,040 INFO L124 PetriNetUnfolderBase]: 320/800 cut-off events. [2025-03-04 15:23:46,040 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 15:23:46,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 800 events. 320/800 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4067 event pairs, 194 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1469. Up to 438 conditions per place. [2025-03-04 15:23:46,044 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 54 selfloop transitions, 4 changer transitions 9/88 dead transitions. [2025-03-04 15:23:46,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 324 flow [2025-03-04 15:23:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-03-04 15:23:46,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-03-04 15:23:46,045 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 124 flow. Second operand 4 states and 196 transitions. [2025-03-04 15:23:46,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 324 flow [2025-03-04 15:23:46,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:46,049 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 124 flow [2025-03-04 15:23:46,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-03-04 15:23:46,049 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-03-04 15:23:46,051 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 124 flow [2025-03-04 15:23:46,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:46,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:23:46,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -220039422, now seen corresponding path program 1 times [2025-03-04 15:23:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950253633] [2025-03-04 15:23:46,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:46,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:23:46,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:23:46,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:46,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:46,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:46,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950253633] [2025-03-04 15:23:46,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950253633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:46,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452056808] [2025-03-04 15:23:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:46,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:46,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:46,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:46,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 15:23:46,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:46,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 15:23:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:46,234 INFO L124 PetriNetUnfolderBase]: 273/778 cut-off events. [2025-03-04 15:23:46,235 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 15:23:46,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 778 events. 273/778 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4010 event pairs, 180 based on Foata normal form. 19/732 useless extension candidates. Maximal degree in co-relation 1375. Up to 392 conditions per place. [2025-03-04 15:23:46,240 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 52 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-04 15:23:46,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 272 flow [2025-03-04 15:23:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2025-03-04 15:23:46,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6844444444444444 [2025-03-04 15:23:46,243 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 124 flow. Second operand 3 states and 154 transitions. [2025-03-04 15:23:46,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 272 flow [2025-03-04 15:23:46,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:46,245 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 118 flow [2025-03-04 15:23:46,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-04 15:23:46,245 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2025-03-04 15:23:46,246 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 118 flow [2025-03-04 15:23:46,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:46,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:46,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:23:46,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1768713046, now seen corresponding path program 1 times [2025-03-04 15:23:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783393990] [2025-03-04 15:23:46,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:46,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:46,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:46,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:46,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:46,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783393990] [2025-03-04 15:23:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783393990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:46,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217648641] [2025-03-04 15:23:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:46,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:46,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:46,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:46,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-04 15:23:46,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:46,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-04 15:23:46,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:46,444 INFO L124 PetriNetUnfolderBase]: 273/759 cut-off events. [2025-03-04 15:23:46,444 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 15:23:46,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 759 events. 273/759 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3843 event pairs, 180 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1349. Up to 392 conditions per place. [2025-03-04 15:23:46,447 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 52 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-03-04 15:23:46,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 260 flow [2025-03-04 15:23:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-04 15:23:46,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6577777777777778 [2025-03-04 15:23:46,448 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 118 flow. Second operand 3 states and 148 transitions. [2025-03-04 15:23:46,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 260 flow [2025-03-04 15:23:46,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:46,450 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 116 flow [2025-03-04 15:23:46,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2025-03-04 15:23:46,450 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2025-03-04 15:23:46,450 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 116 flow [2025-03-04 15:23:46,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:46,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:46,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:23:46,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:46,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1768712053, now seen corresponding path program 1 times [2025-03-04 15:23:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213955871] [2025-03-04 15:23:46,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:46,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:46,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:46,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213955871] [2025-03-04 15:23:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213955871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:23:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054404097] [2025-03-04 15:23:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:46,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:46,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:46,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-04 15:23:46,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:46,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-04 15:23:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:46,881 INFO L124 PetriNetUnfolderBase]: 489/1219 cut-off events. [2025-03-04 15:23:46,882 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:23:46,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 1219 events. 489/1219 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6953 event pairs, 201 based on Foata normal form. 19/1219 useless extension candidates. Maximal degree in co-relation 2268. Up to 514 conditions per place. [2025-03-04 15:23:46,885 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 83 selfloop transitions, 7 changer transitions 13/118 dead transitions. [2025-03-04 15:23:46,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 118 transitions, 452 flow [2025-03-04 15:23:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:23:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:23:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2025-03-04 15:23:46,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-03-04 15:23:46,887 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 116 flow. Second operand 7 states and 320 transitions. [2025-03-04 15:23:46,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 118 transitions, 452 flow [2025-03-04 15:23:46,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:46,891 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 139 flow [2025-03-04 15:23:46,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2025-03-04 15:23:46,892 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2025-03-04 15:23:46,892 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 139 flow [2025-03-04 15:23:46,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:46,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:46,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:23:46,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:46,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1004500667, now seen corresponding path program 1 times [2025-03-04 15:23:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:46,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848834971] [2025-03-04 15:23:46,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:46,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:23:46,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:23:46,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:46,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:46,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848834971] [2025-03-04 15:23:46,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848834971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:46,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:46,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:23:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845263986] [2025-03-04 15:23:46,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:46,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:46,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:46,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:46,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-04 15:23:46,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:46,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:46,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-04 15:23:46,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:47,105 INFO L124 PetriNetUnfolderBase]: 327/941 cut-off events. [2025-03-04 15:23:47,105 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-03-04 15:23:47,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 941 events. 327/941 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5303 event pairs, 169 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1755. Up to 382 conditions per place. [2025-03-04 15:23:47,109 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 68 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2025-03-04 15:23:47,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 357 flow [2025-03-04 15:23:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-03-04 15:23:47,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-03-04 15:23:47,110 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 139 flow. Second operand 4 states and 194 transitions. [2025-03-04 15:23:47,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 357 flow [2025-03-04 15:23:47,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 357 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:47,111 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 147 flow [2025-03-04 15:23:47,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2025-03-04 15:23:47,112 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2025-03-04 15:23:47,112 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 147 flow [2025-03-04 15:23:47,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:47,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:47,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:47,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:23:47,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1072154015, now seen corresponding path program 1 times [2025-03-04 15:23:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325189781] [2025-03-04 15:23:47,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:47,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:23:47,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:23:47,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:47,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:47,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325189781] [2025-03-04 15:23:47,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325189781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:47,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:47,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:47,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244564248] [2025-03-04 15:23:47,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:47,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:47,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:47,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:47,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 15:23:47,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:47,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:47,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 15:23:47,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:47,314 INFO L124 PetriNetUnfolderBase]: 341/913 cut-off events. [2025-03-04 15:23:47,315 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-03-04 15:23:47,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 913 events. 341/913 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4987 event pairs, 216 based on Foata normal form. 34/942 useless extension candidates. Maximal degree in co-relation 1858. Up to 514 conditions per place. [2025-03-04 15:23:47,317 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 60 selfloop transitions, 2 changer transitions 13/88 dead transitions. [2025-03-04 15:23:47,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 375 flow [2025-03-04 15:23:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-03-04 15:23:47,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6766666666666666 [2025-03-04 15:23:47,318 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 147 flow. Second operand 4 states and 203 transitions. [2025-03-04 15:23:47,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 375 flow [2025-03-04 15:23:47,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 365 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:47,320 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 114 flow [2025-03-04 15:23:47,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-03-04 15:23:47,321 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-03-04 15:23:47,321 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 114 flow [2025-03-04 15:23:47,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:47,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:47,321 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] [2025-03-04 15:23:47,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:23:47,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:47,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1248754568, now seen corresponding path program 1 times [2025-03-04 15:23:47,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573572396] [2025-03-04 15:23:47,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:47,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:23:47,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:23:47,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:47,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573572396] [2025-03-04 15:23:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573572396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:23:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802045060] [2025-03-04 15:23:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:47,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:23:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:47,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:23:47,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:47,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2025-03-04 15:23:47,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:47,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:47,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2025-03-04 15:23:47,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:47,785 INFO L124 PetriNetUnfolderBase]: 269/694 cut-off events. [2025-03-04 15:23:47,785 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-03-04 15:23:47,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 694 events. 269/694 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3424 event pairs, 111 based on Foata normal form. 15/705 useless extension candidates. Maximal degree in co-relation 1403. Up to 267 conditions per place. [2025-03-04 15:23:47,788 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 43 selfloop transitions, 4 changer transitions 45/105 dead transitions. [2025-03-04 15:23:47,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 105 transitions, 428 flow [2025-03-04 15:23:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:23:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:23:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 318 transitions. [2025-03-04 15:23:47,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-04 15:23:47,790 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 114 flow. Second operand 8 states and 318 transitions. [2025-03-04 15:23:47,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 105 transitions, 428 flow [2025-03-04 15:23:47,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 405 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 15:23:47,792 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 121 flow [2025-03-04 15:23:47,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=121, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-03-04 15:23:47,793 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-03-04 15:23:47,793 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 121 flow [2025-03-04 15:23:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:47,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:47,793 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-04 15:23:47,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:23:47,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:47,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1839046172, now seen corresponding path program 1 times [2025-03-04 15:23:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642205610] [2025-03-04 15:23:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:47,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:23:47,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:23:47,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:47,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642205610] [2025-03-04 15:23:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642205610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:23:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631431237] [2025-03-04 15:23:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:47,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:47,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:47,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:47,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 15:23:47,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:47,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:47,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 15:23:47,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:48,091 INFO L124 PetriNetUnfolderBase]: 125/369 cut-off events. [2025-03-04 15:23:48,091 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-04 15:23:48,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 369 events. 125/369 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1391 event pairs, 89 based on Foata normal form. 11/378 useless extension candidates. Maximal degree in co-relation 746. Up to 204 conditions per place. [2025-03-04 15:23:48,092 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 36 selfloop transitions, 3 changer transitions 13/66 dead transitions. [2025-03-04 15:23:48,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 267 flow [2025-03-04 15:23:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-03-04 15:23:48,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-03-04 15:23:48,094 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 121 flow. Second operand 6 states and 264 transitions. [2025-03-04 15:23:48,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 267 flow [2025-03-04 15:23:48,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 245 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 15:23:48,095 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 115 flow [2025-03-04 15:23:48,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-03-04 15:23:48,095 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2025-03-04 15:23:48,095 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 115 flow [2025-03-04 15:23:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:48,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:48,096 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-04 15:23:48,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:23:48,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:23:48,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1377795000, now seen corresponding path program 1 times [2025-03-04 15:23:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299108794] [2025-03-04 15:23:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:48,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:23:48,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:23:48,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:48,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299108794] [2025-03-04 15:23:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299108794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:23:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4667408] [2025-03-04 15:23:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:48,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:23:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:48,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:23:48,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:48,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 75 [2025-03-04 15:23:48,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 115 flow. Second operand has 8 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:48,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:48,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 75 [2025-03-04 15:23:48,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:48,449 INFO L124 PetriNetUnfolderBase]: 117/324 cut-off events. [2025-03-04 15:23:48,449 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 15:23:48,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 324 events. 117/324 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1117 event pairs, 51 based on Foata normal form. 8/330 useless extension candidates. Maximal degree in co-relation 645. Up to 124 conditions per place. [2025-03-04 15:23:48,450 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 0 selfloop transitions, 0 changer transitions 72/72 dead transitions. [2025-03-04 15:23:48,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 292 flow [2025-03-04 15:23:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:23:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:23:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2025-03-04 15:23:48,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46166666666666667 [2025-03-04 15:23:48,452 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 115 flow. Second operand 8 states and 277 transitions. [2025-03-04 15:23:48,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 292 flow [2025-03-04 15:23:48,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 278 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:48,453 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2025-03-04 15:23:48,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2025-03-04 15:23:48,454 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2025-03-04 15:23:48,454 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2025-03-04 15:23:48,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:48,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-04 15:23:48,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-04 15:23:48,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-04 15:23:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:23:48,460 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:48,464 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:23:48,464 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:23:48,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:23:48 BasicIcfg [2025-03-04 15:23:48,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:23:48,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:23:48,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:23:48,470 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:23:48,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:43" (3/4) ... [2025-03-04 15:23:48,473 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:23:48,475 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 15:23:48,479 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-03-04 15:23:48,479 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 15:23:48,479 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 15:23:48,479 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:23:48,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:23:48,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:23:48,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:23:48,544 INFO L158 Benchmark]: Toolchain (without parser) took 5953.34ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 104.9MB in the beginning and 99.6MB in the end (delta: 5.3MB). Peak memory consumption was 171.8MB. Max. memory is 16.1GB. [2025-03-04 15:23:48,544 INFO L158 Benchmark]: CDTParser took 1.25ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:23:48,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.24ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 84.2MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:23:48,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.68ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:23:48,546 INFO L158 Benchmark]: Boogie Preprocessor took 42.29ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:23:48,546 INFO L158 Benchmark]: IcfgBuilder took 579.36ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 100.2MB in the end (delta: -20.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-03-04 15:23:48,546 INFO L158 Benchmark]: TraceAbstraction took 4799.53ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 100.2MB in the beginning and 106.4MB in the end (delta: -6.2MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. [2025-03-04 15:23:48,546 INFO L158 Benchmark]: Witness Printer took 73.29ms. Allocated memory is still 310.4MB. Free memory was 106.4MB in the beginning and 99.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:23:48,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.24ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 84.2MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.68ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.29ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 579.36ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 100.2MB in the end (delta: -20.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4799.53ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 100.2MB in the beginning and 106.4MB in the end (delta: -6.2MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. * Witness Printer took 73.29ms. Allocated memory is still 310.4MB. Free memory was 106.4MB in the beginning and 99.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 103 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2728 IncrementalHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 69 mSDtfsCounter, 2728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:23:48,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE