./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_12-ptr_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_12-ptr_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b5f4c57d88bf6e97d091c1ec0f5525d1ae2da6c31cffbcaaf02c59d6e6570e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:42:39,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:42:39,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:42:39,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:42:39,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:42:39,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:42:39,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:42:39,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:42:39,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:42:39,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:42:39,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:42:39,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:42:39,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:42:39,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:42:39,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:42:39,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:42:39,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:42:39,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:42:39,503 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b5f4c57d88bf6e97d091c1ec0f5525d1ae2da6c31cffbcaaf02c59d6e6570e5 [2025-02-06 18:42:39,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:42:39,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:42:39,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:42:39,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:42:39,714 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:42:39,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_12-ptr_nr.i [2025-02-06 18:42:40,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9523f7b0/c5291ea82f98489698f96c414e2d9070/FLAGae7f83355 [2025-02-06 18:42:41,138 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:42:41,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_12-ptr_nr.i [2025-02-06 18:42:41,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9523f7b0/c5291ea82f98489698f96c414e2d9070/FLAGae7f83355 [2025-02-06 18:42:41,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9523f7b0/c5291ea82f98489698f96c414e2d9070 [2025-02-06 18:42:41,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:42:41,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:42:41,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:42:41,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:42:41,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:42:41,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e878d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41, skipping insertion in model container [2025-02-06 18:42:41,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:42:41,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:42:41,445 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:42:41,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:42:41,520 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:42:41,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41 WrapperNode [2025-02-06 18:42:41,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:42:41,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:42:41,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:42:41,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:42:41,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,561 INFO L138 Inliner]: procedures = 262, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 90 [2025-02-06 18:42:41,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:42:41,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:42:41,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:42:41,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:42:41,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,583 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [5, 1]. The 2 writes are split as follows [0, 2]. [2025-02-06 18:42:41,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:42:41,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:42:41,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:42:41,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:42:41,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (1/1) ... [2025-02-06 18:42:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:42:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:42:41,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:42:41,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:42:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:42:41,633 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:42:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:42:41,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:42:41,634 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:42:41,721 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:42:41,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:42:41,866 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:42:41,866 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:42:42,034 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:42:42,034 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:42:42,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:42:42 BoogieIcfgContainer [2025-02-06 18:42:42,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:42:42,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:42:42,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:42:42,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:42:42,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:42:41" (1/3) ... [2025-02-06 18:42:42,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3aae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:42:42, skipping insertion in model container [2025-02-06 18:42:42,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:42:41" (2/3) ... [2025-02-06 18:42:42,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3aae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:42:42, skipping insertion in model container [2025-02-06 18:42:42,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:42:42" (3/3) ... [2025-02-06 18:42:42,044 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_12-ptr_nr.i [2025-02-06 18:42:42,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:42:42,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_12-ptr_nr.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-06 18:42:42,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:42:42,091 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:42:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 53 flow [2025-02-06 18:42:42,140 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-06 18:42:42,143 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:42:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 18:42:42,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 23 transitions, 53 flow [2025-02-06 18:42:42,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-02-06 18:42:42,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:42:42,167 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;@10ee6580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:42:42,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 18:42:42,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:42:42,174 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-06 18:42:42,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:42:42,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:42,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:42:42,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1313665534, now seen corresponding path program 1 times [2025-02-06 18:42:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868278166] [2025-02-06 18:42:42,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:42,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:42:42,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:42:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868278166] [2025-02-06 18:42:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868278166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:42:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144942816] [2025-02-06 18:42:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:42,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:42:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:42,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:42:42,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:42:42,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-02-06 18:42:42,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:42,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:42,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-02-06 18:42:42,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:42,634 INFO L124 PetriNetUnfolderBase]: 33/98 cut-off events. [2025-02-06 18:42:42,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:42:42,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 98 events. 33/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 7 based on Foata normal form. 6/101 useless extension candidates. Maximal degree in co-relation 176. Up to 55 conditions per place. [2025-02-06 18:42:42,637 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 22 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-02-06 18:42:42,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 145 flow [2025-02-06 18:42:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:42:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:42:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-02-06 18:42:42,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-02-06 18:42:42,649 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 6 states and 73 transitions. [2025-02-06 18:42:42,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 145 flow [2025-02-06 18:42:42,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:42:42,653 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 80 flow [2025-02-06 18:42:42,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-02-06 18:42:42,657 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-02-06 18:42:42,657 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 80 flow [2025-02-06 18:42:42,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:42,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:42,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:42:42,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:42:42,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:42,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1313799468, now seen corresponding path program 1 times [2025-02-06 18:42:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673366103] [2025-02-06 18:42:42,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:42,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:42:42,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:42:42,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:42,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:42,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673366103] [2025-02-06 18:42:42,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673366103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:42:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233436836] [2025-02-06 18:42:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:42,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:42:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:42,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:42:42,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:42:42,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-02-06 18:42:42,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:42,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:42,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-02-06 18:42:42,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:42,887 INFO L124 PetriNetUnfolderBase]: 26/91 cut-off events. [2025-02-06 18:42:42,887 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-06 18:42:42,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 91 events. 26/91 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 297 event pairs, 13 based on Foata normal form. 14/105 useless extension candidates. Maximal degree in co-relation 201. Up to 44 conditions per place. [2025-02-06 18:42:42,889 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 19 selfloop transitions, 5 changer transitions 4/33 dead transitions. [2025-02-06 18:42:42,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 167 flow [2025-02-06 18:42:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:42:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:42:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-02-06 18:42:42,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5304347826086957 [2025-02-06 18:42:42,890 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 80 flow. Second operand 5 states and 61 transitions. [2025-02-06 18:42:42,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 167 flow [2025-02-06 18:42:42,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 158 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 18:42:42,891 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 100 flow [2025-02-06 18:42:42,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-02-06 18:42:42,892 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-02-06 18:42:42,892 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 100 flow [2025-02-06 18:42:42,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:42,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:42,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:42,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:42:42,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1305746347, now seen corresponding path program 1 times [2025-02-06 18:42:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918663771] [2025-02-06 18:42:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:42,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:42:42,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:42:42,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:42,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918663771] [2025-02-06 18:42:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918663771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:43,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:42:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748596453] [2025-02-06 18:42:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:43,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:42:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:43,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:42:43,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:42:43,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 23 [2025-02-06 18:42:43,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:43,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 23 [2025-02-06 18:42:43,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:43,041 INFO L124 PetriNetUnfolderBase]: 12/56 cut-off events. [2025-02-06 18:42:43,042 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 18:42:43,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 56 events. 12/56 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 3 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 136. Up to 26 conditions per place. [2025-02-06 18:42:43,042 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-02-06 18:42:43,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 156 flow [2025-02-06 18:42:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:42:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:42:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-02-06 18:42:43,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2025-02-06 18:42:43,043 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 100 flow. Second operand 3 states and 42 transitions. [2025-02-06 18:42:43,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 156 flow [2025-02-06 18:42:43,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 148 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 18:42:43,044 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2025-02-06 18:42:43,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-02-06 18:42:43,045 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-02-06 18:42:43,045 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2025-02-06 18:42:43,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:43,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:43,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:42:43,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:43,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1475052007, now seen corresponding path program 1 times [2025-02-06 18:42:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:43,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011585006] [2025-02-06 18:42:43,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:43,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:42:43,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:42:43,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:43,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011585006] [2025-02-06 18:42:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011585006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839105110] [2025-02-06 18:42:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:43,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:43,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:43,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:43,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:43,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:43,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:43,379 INFO L124 PetriNetUnfolderBase]: 13/65 cut-off events. [2025-02-06 18:42:43,379 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-02-06 18:42:43,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 65 events. 13/65 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 4 based on Foata normal form. 3/68 useless extension candidates. Maximal degree in co-relation 167. Up to 31 conditions per place. [2025-02-06 18:42:43,380 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 23 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2025-02-06 18:42:43,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 208 flow [2025-02-06 18:42:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:42:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:42:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2025-02-06 18:42:43,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3532608695652174 [2025-02-06 18:42:43,382 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 8 states and 65 transitions. [2025-02-06 18:42:43,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 208 flow [2025-02-06 18:42:43,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:42:43,383 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 154 flow [2025-02-06 18:42:43,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2025-02-06 18:42:43,383 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2025-02-06 18:42:43,384 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 154 flow [2025-02-06 18:42:43,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:43,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:43,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:42:43,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 531326333, now seen corresponding path program 2 times [2025-02-06 18:42:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328135465] [2025-02-06 18:42:43,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:42:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:43,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:42:43,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:42:43,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:42:43,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328135465] [2025-02-06 18:42:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328135465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461433399] [2025-02-06 18:42:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:43,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:43,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:43,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:43,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:43,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:43,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:43,662 INFO L124 PetriNetUnfolderBase]: 12/71 cut-off events. [2025-02-06 18:42:43,662 INFO L125 PetriNetUnfolderBase]: For 112/114 co-relation queries the response was YES. [2025-02-06 18:42:43,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 71 events. 12/71 cut-off events. For 112/114 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 231 event pairs, 9 based on Foata normal form. 3/74 useless extension candidates. Maximal degree in co-relation 197. Up to 34 conditions per place. [2025-02-06 18:42:43,662 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 22 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2025-02-06 18:42:43,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 36 transitions, 256 flow [2025-02-06 18:42:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:42:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:42:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2025-02-06 18:42:43,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33695652173913043 [2025-02-06 18:42:43,663 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 154 flow. Second operand 8 states and 62 transitions. [2025-02-06 18:42:43,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 36 transitions, 256 flow [2025-02-06 18:42:43,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 36 transitions, 250 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:42:43,665 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 214 flow [2025-02-06 18:42:43,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-02-06 18:42:43,666 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-02-06 18:42:43,666 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 214 flow [2025-02-06 18:42:43,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:43,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:42:43,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1297094153, now seen corresponding path program 1 times [2025-02-06 18:42:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269469681] [2025-02-06 18:42:43,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:43,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:42:43,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:42:43,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:43,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:43,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269469681] [2025-02-06 18:42:43,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269469681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:43,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:43,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577085845] [2025-02-06 18:42:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:43,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:43,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:43,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:43,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:43,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:43,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:43,962 INFO L124 PetriNetUnfolderBase]: 11/68 cut-off events. [2025-02-06 18:42:43,962 INFO L125 PetriNetUnfolderBase]: For 183/185 co-relation queries the response was YES. [2025-02-06 18:42:43,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 68 events. 11/68 cut-off events. For 183/185 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 2 based on Foata normal form. 4/72 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2025-02-06 18:42:43,963 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 25 selfloop transitions, 9 changer transitions 0/37 dead transitions. [2025-02-06 18:42:43,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 37 transitions, 295 flow [2025-02-06 18:42:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:42:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:42:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-02-06 18:42:43,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35403726708074534 [2025-02-06 18:42:43,964 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 214 flow. Second operand 7 states and 57 transitions. [2025-02-06 18:42:43,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 37 transitions, 295 flow [2025-02-06 18:42:43,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 37 transitions, 282 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 18:42:43,967 INFO L231 Difference]: Finished difference. Result has 58 places, 30 transitions, 215 flow [2025-02-06 18:42:43,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=58, PETRI_TRANSITIONS=30} [2025-02-06 18:42:43,967 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 34 predicate places. [2025-02-06 18:42:43,967 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 30 transitions, 215 flow [2025-02-06 18:42:43,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:43,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:43,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:42:43,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:43,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash -825060245, now seen corresponding path program 3 times [2025-02-06 18:42:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851828475] [2025-02-06 18:42:43,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:42:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:43,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:42:43,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:42:43,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 18:42:43,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851828475] [2025-02-06 18:42:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851828475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:44,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144165484] [2025-02-06 18:42:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:44,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:44,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:44,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:44,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 30 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:44,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:44,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:44,235 INFO L124 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-02-06 18:42:44,235 INFO L125 PetriNetUnfolderBase]: For 196/198 co-relation queries the response was YES. [2025-02-06 18:42:44,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 66 events. 11/66 cut-off events. For 196/198 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 7 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 214. Up to 19 conditions per place. [2025-02-06 18:42:44,236 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2025-02-06 18:42:44,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 283 flow [2025-02-06 18:42:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:42:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:42:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-02-06 18:42:44,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32065217391304346 [2025-02-06 18:42:44,237 INFO L175 Difference]: Start difference. First operand has 58 places, 30 transitions, 215 flow. Second operand 8 states and 59 transitions. [2025-02-06 18:42:44,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 283 flow [2025-02-06 18:42:44,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 252 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-06 18:42:44,239 INFO L231 Difference]: Finished difference. Result has 56 places, 29 transitions, 198 flow [2025-02-06 18:42:44,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=29} [2025-02-06 18:42:44,239 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 32 predicate places. [2025-02-06 18:42:44,239 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 29 transitions, 198 flow [2025-02-06 18:42:44,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:44,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:44,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:42:44,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:44,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1555213264, now seen corresponding path program 1 times [2025-02-06 18:42:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498379027] [2025-02-06 18:42:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:44,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:42:44,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:42:44,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:44,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:44,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:44,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498379027] [2025-02-06 18:42:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498379027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:44,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911320223] [2025-02-06 18:42:44,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:44,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:44,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:44,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:44,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:44,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:44,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:44,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:44,528 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2025-02-06 18:42:44,528 INFO L125 PetriNetUnfolderBase]: For 172/174 co-relation queries the response was YES. [2025-02-06 18:42:44,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 64 events. 10/64 cut-off events. For 172/174 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 200 event pairs, 2 based on Foata normal form. 4/68 useless extension candidates. Maximal degree in co-relation 199. Up to 19 conditions per place. [2025-02-06 18:42:44,528 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 14 selfloop transitions, 8 changer transitions 10/35 dead transitions. [2025-02-06 18:42:44,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 35 transitions, 275 flow [2025-02-06 18:42:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:42:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:42:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2025-02-06 18:42:44,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30917874396135264 [2025-02-06 18:42:44,529 INFO L175 Difference]: Start difference. First operand has 56 places, 29 transitions, 198 flow. Second operand 9 states and 64 transitions. [2025-02-06 18:42:44,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 35 transitions, 275 flow [2025-02-06 18:42:44,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 35 transitions, 238 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-06 18:42:44,531 INFO L231 Difference]: Finished difference. Result has 55 places, 23 transitions, 149 flow [2025-02-06 18:42:44,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=55, PETRI_TRANSITIONS=23} [2025-02-06 18:42:44,531 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-02-06 18:42:44,531 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 23 transitions, 149 flow [2025-02-06 18:42:44,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:44,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:44,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:42:44,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:44,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1698602534, now seen corresponding path program 1 times [2025-02-06 18:42:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728247780] [2025-02-06 18:42:44,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:42:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:44,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:42:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:42:44,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:42:44,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:44,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-02-06 18:42:44,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:44,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728247780] [2025-02-06 18:42:44,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728247780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:44,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:44,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:44,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009312904] [2025-02-06 18:42:44,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:44,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:44,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:44,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:44,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:44,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:44,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 23 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:44,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:44,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:44,702 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-02-06 18:42:44,702 INFO L125 PetriNetUnfolderBase]: For 96/98 co-relation queries the response was YES. [2025-02-06 18:42:44,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 40 events. 4/40 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 3/43 useless extension candidates. Maximal degree in co-relation 124. Up to 14 conditions per place. [2025-02-06 18:42:44,703 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 11 selfloop transitions, 4 changer transitions 9/27 dead transitions. [2025-02-06 18:42:44,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 27 transitions, 202 flow [2025-02-06 18:42:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:42:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:42:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2025-02-06 18:42:44,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3105590062111801 [2025-02-06 18:42:44,704 INFO L175 Difference]: Start difference. First operand has 55 places, 23 transitions, 149 flow. Second operand 7 states and 50 transitions. [2025-02-06 18:42:44,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 27 transitions, 202 flow [2025-02-06 18:42:44,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 27 transitions, 156 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-02-06 18:42:44,704 INFO L231 Difference]: Finished difference. Result has 42 places, 18 transitions, 83 flow [2025-02-06 18:42:44,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=18} [2025-02-06 18:42:44,705 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 18 predicate places. [2025-02-06 18:42:44,705 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 18 transitions, 83 flow [2025-02-06 18:42:44,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:44,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:44,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:42:44,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -708752652, now seen corresponding path program 2 times [2025-02-06 18:42:44,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:44,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426000882] [2025-02-06 18:42:44,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:42:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:44,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:42:44,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:42:44,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:42:44,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426000882] [2025-02-06 18:42:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426000882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:44,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:44,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:44,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639330180] [2025-02-06 18:42:44,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:44,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:44,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:44,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:44,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 18 transitions, 83 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:44,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:44,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:44,869 INFO L124 PetriNetUnfolderBase]: 1/23 cut-off events. [2025-02-06 18:42:44,869 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2025-02-06 18:42:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 23 events. 1/23 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 1 based on Foata normal form. 3/26 useless extension candidates. Maximal degree in co-relation 58. Up to 9 conditions per place. [2025-02-06 18:42:44,869 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 8 selfloop transitions, 3 changer transitions 5/19 dead transitions. [2025-02-06 18:42:44,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 19 transitions, 113 flow [2025-02-06 18:42:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:42:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:42:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2025-02-06 18:42:44,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2795031055900621 [2025-02-06 18:42:44,870 INFO L175 Difference]: Start difference. First operand has 42 places, 18 transitions, 83 flow. Second operand 7 states and 45 transitions. [2025-02-06 18:42:44,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 19 transitions, 113 flow [2025-02-06 18:42:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 19 transitions, 96 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:42:44,871 INFO L231 Difference]: Finished difference. Result has 34 places, 14 transitions, 51 flow [2025-02-06 18:42:44,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=51, PETRI_PLACES=34, PETRI_TRANSITIONS=14} [2025-02-06 18:42:44,871 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-02-06 18:42:44,871 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 14 transitions, 51 flow [2025-02-06 18:42:44,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:42:44,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:42:44,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:42:44,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 18:42:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:42:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 109819500, now seen corresponding path program 3 times [2025-02-06 18:42:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:42:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968645681] [2025-02-06 18:42:44,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:42:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:42:44,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:42:44,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:42:44,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 18:42:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:42:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:42:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:42:44,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968645681] [2025-02-06 18:42:44,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968645681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:42:44,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:42:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:42:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110187047] [2025-02-06 18:42:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:42:44,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:42:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:42:44,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:42:44,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:42:44,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-02-06 18:42:44,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 14 transitions, 51 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:44,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:42:44,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-02-06 18:42:44,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:42:45,032 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-02-06 18:42:45,032 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 18:42:45,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 15 events. 1/15 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-02-06 18:42:45,033 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-02-06 18:42:45,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 71 flow [2025-02-06 18:42:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:42:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:42:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2025-02-06 18:42:45,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2484472049689441 [2025-02-06 18:42:45,034 INFO L175 Difference]: Start difference. First operand has 34 places, 14 transitions, 51 flow. Second operand 7 states and 40 transitions. [2025-02-06 18:42:45,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 71 flow [2025-02-06 18:42:45,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 18:42:45,035 INFO L231 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2025-02-06 18:42:45,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2025-02-06 18:42:45,035 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-02-06 18:42:45,035 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 0 transitions, 0 flow [2025-02-06 18:42:45,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:42:45,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-02-06 18:42:45,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-02-06 18:42:45,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-02-06 18:42:45,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-02-06 18:42:45,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-02-06 18:42:45,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-02-06 18:42:45,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-02-06 18:42:45,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:42:45,042 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2025-02-06 18:42:45,047 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 18:42:45,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 18:42:45,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:42:45 BasicIcfg [2025-02-06 18:42:45,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 18:42:45,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:42:45,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:42:45,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:42:45,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:42:42" (3/4) ... [2025-02-06 18:42:45,054 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 18:42:45,057 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-06 18:42:45,060 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2025-02-06 18:42:45,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-06 18:42:45,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 18:42:45,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 18:42:45,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 18:42:45,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 18:42:45,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 18:42:45,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 18:42:45,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:42:45,124 INFO L158 Benchmark]: Toolchain (without parser) took 3946.43ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 110.9MB in the beginning and 202.4MB in the end (delta: -91.5MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. [2025-02-06 18:42:45,124 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:42:45,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.63ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 83.2MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 18:42:45,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.20ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:42:45,125 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:42:45,125 INFO L158 Benchmark]: IcfgBuilder took 443.17ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 108.0MB in the end (delta: -28.4MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2025-02-06 18:42:45,125 INFO L158 Benchmark]: TraceAbstraction took 3012.96ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 107.1MB in the beginning and 206.2MB in the end (delta: -99.0MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2025-02-06 18:42:45,125 INFO L158 Benchmark]: Witness Printer took 71.14ms. Allocated memory is still 385.9MB. Free memory was 206.2MB in the beginning and 202.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:42:45,126 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.63ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 83.2MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.20ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 443.17ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 108.0MB in the end (delta: -28.4MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3012.96ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 107.1MB in the beginning and 206.2MB in the end (delta: -99.0MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. * Witness Printer took 71.14ms. Allocated memory is still 385.9MB. Free memory was 206.2MB in the beginning and 202.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 931]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 931]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: 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, 35 locations, 7 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: 2.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 989 IncrementalHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 35 mSDtfsCounter, 989 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=6, InterpolantAutomatonStates: 75, 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.3s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 18:42:45,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE