./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/exponential-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/pthread-theta/exponential-4.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 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:22,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:22,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:57:22,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:22,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:22,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:22,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:22,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:22,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:22,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:22,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:22,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:22,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:22,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:22,585 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:22,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:22,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:22,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:22,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:22,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:22,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:22,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:22,591 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 -> 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 [2025-01-10 06:57:22,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:22,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:22,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:22,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:22,873 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:22,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-4.i [2025-01-10 06:57:24,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43265fd51/a56f2c8cbd6046259a7fbfdcfb6465f2/FLAG035a30bd1 [2025-01-10 06:57:24,402 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:24,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i [2025-01-10 06:57:24,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43265fd51/a56f2c8cbd6046259a7fbfdcfb6465f2/FLAG035a30bd1 [2025-01-10 06:57:24,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43265fd51/a56f2c8cbd6046259a7fbfdcfb6465f2 [2025-01-10 06:57:24,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:24,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:24,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:24,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:24,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:24,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:24,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd6a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24, skipping insertion in model container [2025-01-10 06:57:24,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:24,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:24,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:24,898 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:24,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:24,959 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:24,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24 WrapperNode [2025-01-10 06:57:24,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:24,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:24,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:24,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:24,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:24,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:24,989 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-01-10 06:57:24,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:24,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:24,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:24,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:24,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:24,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:24,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,011 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:57:25,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:25,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:25,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:25,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:25,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (1/1) ... [2025-01-10 06:57:25,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:25,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:25,057 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-01-10 06:57:25,059 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-01-10 06:57:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:25,076 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:25,076 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:25,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:25,078 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:57:25,176 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:25,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:25,310 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:25,311 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:25,407 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:25,407 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:25,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:25 BoogieIcfgContainer [2025-01-10 06:57:25,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:25,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:25,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:25,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:25,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:24" (1/3) ... [2025-01-10 06:57:25,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33374347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:25, skipping insertion in model container [2025-01-10 06:57:25,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:24" (2/3) ... [2025-01-10 06:57:25,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33374347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:25, skipping insertion in model container [2025-01-10 06:57:25,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:25" (3/3) ... [2025-01-10 06:57:25,416 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-4.i [2025-01-10 06:57:25,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:25,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-4.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 06:57:25,428 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:25,463 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:25,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2025-01-10 06:57:25,512 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-01-10 06:57:25,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:25,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 2/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-01-10 06:57:25,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 58 flow [2025-01-10 06:57:25,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 53 flow [2025-01-10 06:57:25,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:25,540 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;@3151766b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:25,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:25,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:25,544 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:25,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:25,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:25,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:25,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:25,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 6797239, now seen corresponding path program 1 times [2025-01-10 06:57:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777971839] [2025-01-10 06:57:25,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:25,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:25,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:25,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:25,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777971839] [2025-01-10 06:57:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777971839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989231331] [2025-01-10 06:57:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:25,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:25,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:25,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:25,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 25 [2025-01-10 06:57:25,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-01-10 06:57:25,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:25,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 25 [2025-01-10 06:57:25,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:25,825 INFO L124 PetriNetUnfolderBase]: 27/91 cut-off events. [2025-01-10 06:57:25,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:25,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 91 events. 27/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 7 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 142. Up to 37 conditions per place. [2025-01-10 06:57:25,828 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 13 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-01-10 06:57:25,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 89 flow [2025-01-10 06:57:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 06:57:25,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-01-10 06:57:25,842 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 53 flow. Second operand 3 states and 52 transitions. [2025-01-10 06:57:25,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 89 flow [2025-01-10 06:57:25,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:25,848 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 60 flow [2025-01-10 06:57:25,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2025-01-10 06:57:25,854 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-01-10 06:57:25,854 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 60 flow [2025-01-10 06:57:25,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-01-10 06:57:25,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:25,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:25,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:25,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:25,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash 684620930, now seen corresponding path program 1 times [2025-01-10 06:57:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:25,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26956342] [2025-01-10 06:57:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:25,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:25,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:25,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:25,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:25,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:25,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26956342] [2025-01-10 06:57:25,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26956342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:25,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222732445] [2025-01-10 06:57:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:25,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:25,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:25,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:25,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2025-01-10 06:57:25,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-10 06:57:25,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:25,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2025-01-10 06:57:25,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:25,987 INFO L124 PetriNetUnfolderBase]: 27/81 cut-off events. [2025-01-10 06:57:25,987 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:57:25,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 81 events. 27/81 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 287 event pairs, 3 based on Foata normal form. 8/83 useless extension candidates. Maximal degree in co-relation 144. Up to 37 conditions per place. [2025-01-10 06:57:25,988 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-01-10 06:57:25,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 100 flow [2025-01-10 06:57:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-01-10 06:57:25,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 06:57:25,989 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 60 flow. Second operand 4 states and 59 transitions. [2025-01-10 06:57:25,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 100 flow [2025-01-10 06:57:25,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:25,990 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-01-10 06:57:25,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-01-10 06:57:25,991 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-01-10 06:57:25,991 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-01-10 06:57:25,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-10 06:57:25,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:25,991 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:25,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:25,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1257336072, now seen corresponding path program 1 times [2025-01-10 06:57:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797969354] [2025-01-10 06:57:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:25,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:26,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:26,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:26,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:26,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:26,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:26,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:26,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:26,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:26,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:26,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:26,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:26,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:26,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:26,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:26,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:26,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 06:57:26,028 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:26,028 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:57:26,066 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:26,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 86 flow [2025-01-10 06:57:26,075 INFO L124 PetriNetUnfolderBase]: 3/54 cut-off events. [2025-01-10 06:57:26,075 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:57:26,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 54 events. 3/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 49. Up to 6 conditions per place. [2025-01-10 06:57:26,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 86 flow [2025-01-10 06:57:26,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 80 flow [2025-01-10 06:57:26,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:26,079 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;@3151766b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:26,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:26,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:26,081 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:26,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:26,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:26,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:26,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 7813111, now seen corresponding path program 1 times [2025-01-10 06:57:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450785707] [2025-01-10 06:57:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:26,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:26,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:26,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450785707] [2025-01-10 06:57:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450785707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942987835] [2025-01-10 06:57:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:26,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:26,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:26,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:26,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 33 [2025-01-10 06:57:26,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-10 06:57:26,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:26,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 33 [2025-01-10 06:57:26,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:26,240 INFO L124 PetriNetUnfolderBase]: 247/555 cut-off events. [2025-01-10 06:57:26,240 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 06:57:26,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 555 events. 247/555 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3158 event pairs, 99 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 418. Up to 369 conditions per place. [2025-01-10 06:57:26,248 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 06:57:26,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 136 flow [2025-01-10 06:57:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-01-10 06:57:26,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2025-01-10 06:57:26,249 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 80 flow. Second operand 3 states and 71 transitions. [2025-01-10 06:57:26,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 136 flow [2025-01-10 06:57:26,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:26,251 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 91 flow [2025-01-10 06:57:26,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-01-10 06:57:26,251 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2025-01-10 06:57:26,252 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 91 flow [2025-01-10 06:57:26,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-10 06:57:26,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:26,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:26,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:57:26,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 889273232, now seen corresponding path program 1 times [2025-01-10 06:57:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:26,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542871168] [2025-01-10 06:57:26,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:26,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:26,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:26,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542871168] [2025-01-10 06:57:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542871168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406630528] [2025-01-10 06:57:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:26,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:26,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:26,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:26,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:26,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:26,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:57:26,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:26,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:26,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:26,403 INFO L124 PetriNetUnfolderBase]: 311/611 cut-off events. [2025-01-10 06:57:26,403 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-10 06:57:26,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 611 events. 311/611 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3390 event pairs, 127 based on Foata normal form. 8/573 useless extension candidates. Maximal degree in co-relation 500. Up to 465 conditions per place. [2025-01-10 06:57:26,410 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-01-10 06:57:26,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 157 flow [2025-01-10 06:57:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-01-10 06:57:26,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 06:57:26,413 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 91 flow. Second operand 4 states and 84 transitions. [2025-01-10 06:57:26,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 157 flow [2025-01-10 06:57:26,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:26,415 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 107 flow [2025-01-10 06:57:26,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-01-10 06:57:26,416 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-01-10 06:57:26,416 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 107 flow [2025-01-10 06:57:26,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:57:26,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:26,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:57:26,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 341036671, now seen corresponding path program 1 times [2025-01-10 06:57:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086169968] [2025-01-10 06:57:26,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:26,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:26,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:26,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086169968] [2025-01-10 06:57:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086169968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827728257] [2025-01-10 06:57:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:26,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:26,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:26,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:26,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:26,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-01-10 06:57:26,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:26,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:26,603 INFO L124 PetriNetUnfolderBase]: 391/751 cut-off events. [2025-01-10 06:57:26,603 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-10 06:57:26,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 751 events. 391/751 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4306 event pairs, 299 based on Foata normal form. 20/731 useless extension candidates. Maximal degree in co-relation 640. Up to 502 conditions per place. [2025-01-10 06:57:26,608 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 27 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-01-10 06:57:26,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 187 flow [2025-01-10 06:57:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-01-10 06:57:26,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-01-10 06:57:26,611 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 107 flow. Second operand 4 states and 86 transitions. [2025-01-10 06:57:26,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 187 flow [2025-01-10 06:57:26,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:26,613 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 125 flow [2025-01-10 06:57:26,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-01-10 06:57:26,614 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-01-10 06:57:26,615 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 125 flow [2025-01-10 06:57:26,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-01-10 06:57:26,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:26,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:26,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:57:26,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:26,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:26,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2011114678, now seen corresponding path program 1 times [2025-01-10 06:57:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:26,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668631255] [2025-01-10 06:57:26,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:26,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:26,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:26,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:26,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:26,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668631255] [2025-01-10 06:57:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668631255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:26,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790217178] [2025-01-10 06:57:26,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:26,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:26,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:26,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:26,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:26,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:26,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:26,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:26,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:26,808 INFO L124 PetriNetUnfolderBase]: 351/693 cut-off events. [2025-01-10 06:57:26,808 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-01-10 06:57:26,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 693 events. 351/693 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3823 event pairs, 111 based on Foata normal form. 16/699 useless extension candidates. Maximal degree in co-relation 933. Up to 432 conditions per place. [2025-01-10 06:57:26,812 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 26 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-01-10 06:57:26,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 44 transitions, 203 flow [2025-01-10 06:57:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-01-10 06:57:26,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-01-10 06:57:26,815 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 125 flow. Second operand 6 states and 114 transitions. [2025-01-10 06:57:26,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 44 transitions, 203 flow [2025-01-10 06:57:26,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:26,819 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 129 flow [2025-01-10 06:57:26,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-01-10 06:57:26,819 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-01-10 06:57:26,819 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 129 flow [2025-01-10 06:57:26,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:26,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:26,820 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:26,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:57:26,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:26,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2068913261, now seen corresponding path program 1 times [2025-01-10 06:57:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:26,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181505459] [2025-01-10 06:57:26,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:26,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181505459] [2025-01-10 06:57:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181505459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255101435] [2025-01-10 06:57:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:26,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:26,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:26,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:26,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:26,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-10 06:57:26,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:26,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:26,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:26,984 INFO L124 PetriNetUnfolderBase]: 331/643 cut-off events. [2025-01-10 06:57:26,984 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 06:57:26,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 643 events. 331/643 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3434 event pairs, 47 based on Foata normal form. 4/629 useless extension candidates. Maximal degree in co-relation 952. Up to 305 conditions per place. [2025-01-10 06:57:26,987 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 28 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-01-10 06:57:26,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 215 flow [2025-01-10 06:57:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-01-10 06:57:26,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2025-01-10 06:57:26,988 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 129 flow. Second operand 5 states and 101 transitions. [2025-01-10 06:57:26,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 215 flow [2025-01-10 06:57:26,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 204 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:26,990 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 130 flow [2025-01-10 06:57:26,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-01-10 06:57:26,991 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-01-10 06:57:26,991 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 130 flow [2025-01-10 06:57:26,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-10 06:57:26,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:26,991 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:26,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:57:26,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2079954684, now seen corresponding path program 1 times [2025-01-10 06:57:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369972983] [2025-01-10 06:57:26,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:27,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:27,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:27,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369972983] [2025-01-10 06:57:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369972983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:27,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126783069] [2025-01-10 06:57:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:27,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:27,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:27,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:27,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:27,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:27,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:27,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:27,156 INFO L124 PetriNetUnfolderBase]: 299/593 cut-off events. [2025-01-10 06:57:27,157 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-01-10 06:57:27,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 593 events. 299/593 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3166 event pairs, 15 based on Foata normal form. 16/599 useless extension candidates. Maximal degree in co-relation 854. Up to 305 conditions per place. [2025-01-10 06:57:27,161 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 30 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-01-10 06:57:27,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 226 flow [2025-01-10 06:57:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-10 06:57:27,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-01-10 06:57:27,163 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 130 flow. Second operand 6 states and 118 transitions. [2025-01-10 06:57:27,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 226 flow [2025-01-10 06:57:27,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:27,166 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 126 flow [2025-01-10 06:57:27,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2025-01-10 06:57:27,167 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-01-10 06:57:27,167 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 126 flow [2025-01-10 06:57:27,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:27,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:27,168 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:27,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:57:27,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:27,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1676666679, now seen corresponding path program 1 times [2025-01-10 06:57:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459074774] [2025-01-10 06:57:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:57:27,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:57:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:27,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:27,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:57:27,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:57:27,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:27,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:27,191 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:27,192 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:27,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:27,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:27,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:27,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:27,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:27,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:57:27,192 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:27,193 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:27,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:57:27,211 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:27,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 118 flow [2025-01-10 06:57:27,218 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-01-10 06:57:27,218 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 06:57:27,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 76 events. 4/76 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2025-01-10 06:57:27,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 118 flow [2025-01-10 06:57:27,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 111 flow [2025-01-10 06:57:27,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:27,220 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;@3151766b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:27,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:27,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:27,221 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:27,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:27,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:27,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:27,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 9075255, now seen corresponding path program 1 times [2025-01-10 06:57:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800429752] [2025-01-10 06:57:27,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:27,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:27,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800429752] [2025-01-10 06:57:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800429752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:27,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:27,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:27,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776504346] [2025-01-10 06:57:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:27,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:27,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:27,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2025-01-10 06:57:27,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-10 06:57:27,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:27,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2025-01-10 06:57:27,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:27,460 INFO L124 PetriNetUnfolderBase]: 1575/2859 cut-off events. [2025-01-10 06:57:27,460 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-10 06:57:27,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5266 conditions, 2859 events. 1575/2859 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18841 event pairs, 915 based on Foata normal form. 0/2524 useless extension candidates. Maximal degree in co-relation 2330. Up to 2145 conditions per place. [2025-01-10 06:57:27,481 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 24 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-01-10 06:57:27,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 175 flow [2025-01-10 06:57:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 06:57:27,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-01-10 06:57:27,482 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 111 flow. Second operand 3 states and 87 transitions. [2025-01-10 06:57:27,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 175 flow [2025-01-10 06:57:27,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 170 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:27,485 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 118 flow [2025-01-10 06:57:27,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 06:57:27,485 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-01-10 06:57:27,485 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 118 flow [2025-01-10 06:57:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-10 06:57:27,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:27,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:57:27,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -159311962, now seen corresponding path program 1 times [2025-01-10 06:57:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122111948] [2025-01-10 06:57:27,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:27,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:27,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:27,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122111948] [2025-01-10 06:57:27,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122111948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:27,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:27,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:27,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653574138] [2025-01-10 06:57:27,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:27,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:27,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:27,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:27,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:27,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 06:57:27,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:27,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:27,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:27,832 INFO L124 PetriNetUnfolderBase]: 2023/3299 cut-off events. [2025-01-10 06:57:27,833 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-10 06:57:27,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6440 conditions, 3299 events. 2023/3299 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20350 event pairs, 1199 based on Foata normal form. 8/3102 useless extension candidates. Maximal degree in co-relation 2836. Up to 2753 conditions per place. [2025-01-10 06:57:27,854 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 27 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-10 06:57:27,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 192 flow [2025-01-10 06:57:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 06:57:27,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:57:27,855 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 118 flow. Second operand 4 states and 104 transitions. [2025-01-10 06:57:27,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 192 flow [2025-01-10 06:57:27,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:27,857 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 134 flow [2025-01-10 06:57:27,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-01-10 06:57:27,857 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2025-01-10 06:57:27,857 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 134 flow [2025-01-10 06:57:27,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 06:57:27,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:27,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:57:27,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:27,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 466547157, now seen corresponding path program 1 times [2025-01-10 06:57:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576031526] [2025-01-10 06:57:27,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:27,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:27,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576031526] [2025-01-10 06:57:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576031526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:27,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:27,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517746194] [2025-01-10 06:57:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:27,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:27,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:27,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:27,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-01-10 06:57:27,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:27,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:27,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:28,194 INFO L124 PetriNetUnfolderBase]: 2487/4015 cut-off events. [2025-01-10 06:57:28,194 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-01-10 06:57:28,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8051 conditions, 4015 events. 2487/4015 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 25277 event pairs, 1947 based on Foata normal form. 84/3932 useless extension candidates. Maximal degree in co-relation 3552. Up to 2790 conditions per place. [2025-01-10 06:57:28,224 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 35 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-01-10 06:57:28,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 238 flow [2025-01-10 06:57:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-10 06:57:28,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-01-10 06:57:28,225 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 134 flow. Second operand 4 states and 110 transitions. [2025-01-10 06:57:28,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 238 flow [2025-01-10 06:57:28,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:28,231 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 152 flow [2025-01-10 06:57:28,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-01-10 06:57:28,232 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-01-10 06:57:28,232 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 152 flow [2025-01-10 06:57:28,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-01-10 06:57:28,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:28,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:28,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:57:28,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 455814794, now seen corresponding path program 1 times [2025-01-10 06:57:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90423898] [2025-01-10 06:57:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:28,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:28,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:28,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:28,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:28,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90423898] [2025-01-10 06:57:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90423898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315622091] [2025-01-10 06:57:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:28,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:28,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:28,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:28,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:28,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:28,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:28,609 INFO L124 PetriNetUnfolderBase]: 2255/3647 cut-off events. [2025-01-10 06:57:28,609 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-01-10 06:57:28,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8036 conditions, 3647 events. 2255/3647 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22258 event pairs, 663 based on Foata normal form. 80/3686 useless extension candidates. Maximal degree in co-relation 4975. Up to 2464 conditions per place. [2025-01-10 06:57:28,643 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 32 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-01-10 06:57:28,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 246 flow [2025-01-10 06:57:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-01-10 06:57:28,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-01-10 06:57:28,645 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 152 flow. Second operand 6 states and 144 transitions. [2025-01-10 06:57:28,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 246 flow [2025-01-10 06:57:28,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:28,654 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 156 flow [2025-01-10 06:57:28,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-01-10 06:57:28,656 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-01-10 06:57:28,656 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 156 flow [2025-01-10 06:57:28,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:28,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:28,656 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:28,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:57:28,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 392468358, now seen corresponding path program 1 times [2025-01-10 06:57:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792801979] [2025-01-10 06:57:28,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:28,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:28,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792801979] [2025-01-10 06:57:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792801979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663249004] [2025-01-10 06:57:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:28,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:28,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:28,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:28,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-01-10 06:57:28,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:28,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:28,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:29,005 INFO L124 PetriNetUnfolderBase]: 2235/3649 cut-off events. [2025-01-10 06:57:29,005 INFO L125 PetriNetUnfolderBase]: For 890/890 co-relation queries the response was YES. [2025-01-10 06:57:29,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8051 conditions, 3649 events. 2235/3649 cut-off events. For 890/890 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22501 event pairs, 607 based on Foata normal form. 4/3572 useless extension candidates. Maximal degree in co-relation 5174. Up to 2849 conditions per place. [2025-01-10 06:57:29,023 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 36 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-01-10 06:57:29,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 276 flow [2025-01-10 06:57:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-01-10 06:57:29,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-01-10 06:57:29,025 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 156 flow. Second operand 5 states and 129 transitions. [2025-01-10 06:57:29,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 276 flow [2025-01-10 06:57:29,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 261 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:29,031 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 163 flow [2025-01-10 06:57:29,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-01-10 06:57:29,032 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2025-01-10 06:57:29,033 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 163 flow [2025-01-10 06:57:29,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-01-10 06:57:29,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:29,033 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:29,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:57:29,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:29,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1245357029, now seen corresponding path program 1 times [2025-01-10 06:57:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:29,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917132401] [2025-01-10 06:57:29,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:29,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:29,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:29,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:29,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917132401] [2025-01-10 06:57:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917132401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239758010] [2025-01-10 06:57:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:29,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:29,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:29,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:29,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:29,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:29,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:29,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:29,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:29,353 INFO L124 PetriNetUnfolderBase]: 2203/3601 cut-off events. [2025-01-10 06:57:29,354 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2025-01-10 06:57:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7955 conditions, 3601 events. 2203/3601 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22164 event pairs, 575 based on Foata normal form. 16/3544 useless extension candidates. Maximal degree in co-relation 5078. Up to 2849 conditions per place. [2025-01-10 06:57:29,377 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 38 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2025-01-10 06:57:29,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 285 flow [2025-01-10 06:57:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-01-10 06:57:29,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-01-10 06:57:29,378 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 163 flow. Second operand 6 states and 150 transitions. [2025-01-10 06:57:29,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 285 flow [2025-01-10 06:57:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 279 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:29,385 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 179 flow [2025-01-10 06:57:29,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-01-10 06:57:29,386 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-01-10 06:57:29,386 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 179 flow [2025-01-10 06:57:29,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:29,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:29,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:29,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:57:29,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash 501332002, now seen corresponding path program 1 times [2025-01-10 06:57:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:29,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24013514] [2025-01-10 06:57:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:29,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:57:29,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:57:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:29,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:29,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24013514] [2025-01-10 06:57:29,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24013514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:29,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:29,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122296781] [2025-01-10 06:57:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:29,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:57:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:29,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:57:29,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:57:29,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:29,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-10 06:57:29,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:29,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:29,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:29,782 INFO L124 PetriNetUnfolderBase]: 2059/3329 cut-off events. [2025-01-10 06:57:29,783 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2025-01-10 06:57:29,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 3329 events. 2059/3329 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19954 event pairs, 191 based on Foata normal form. 16/3272 useless extension candidates. Maximal degree in co-relation 5114. Up to 1601 conditions per place. [2025-01-10 06:57:29,805 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 44 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2025-01-10 06:57:29,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 325 flow [2025-01-10 06:57:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:57:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:57:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2025-01-10 06:57:29,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-01-10 06:57:29,807 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 179 flow. Second operand 7 states and 175 transitions. [2025-01-10 06:57:29,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 325 flow [2025-01-10 06:57:29,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 317 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:29,813 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 187 flow [2025-01-10 06:57:29,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-01-10 06:57:29,813 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-01-10 06:57:29,813 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 187 flow [2025-01-10 06:57:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-10 06:57:29,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:29,814 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:57:29,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:29,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 353821639, now seen corresponding path program 1 times [2025-01-10 06:57:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044506154] [2025-01-10 06:57:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:29,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:57:29,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:57:29,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:29,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044506154] [2025-01-10 06:57:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044506154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522951896] [2025-01-10 06:57:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:29,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:57:29,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:29,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:57:29,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:29,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:29,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-01-10 06:57:29,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:29,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:29,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:30,131 INFO L124 PetriNetUnfolderBase]: 1867/3033 cut-off events. [2025-01-10 06:57:30,132 INFO L125 PetriNetUnfolderBase]: For 1462/1462 co-relation queries the response was YES. [2025-01-10 06:57:30,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 3033 events. 1867/3033 cut-off events. For 1462/1462 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17599 event pairs, 63 based on Foata normal form. 64/3056 useless extension candidates. Maximal degree in co-relation 4642. Up to 1601 conditions per place. [2025-01-10 06:57:30,151 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-01-10 06:57:30,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 349 flow [2025-01-10 06:57:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:57:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:57:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2025-01-10 06:57:30,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6036585365853658 [2025-01-10 06:57:30,153 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 187 flow. Second operand 8 states and 198 transitions. [2025-01-10 06:57:30,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 349 flow [2025-01-10 06:57:30,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 333 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-01-10 06:57:30,158 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 179 flow [2025-01-10 06:57:30,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2025-01-10 06:57:30,158 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-01-10 06:57:30,158 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 179 flow [2025-01-10 06:57:30,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-01-10 06:57:30,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:30,159 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:30,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:57:30,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:30,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash 720188008, now seen corresponding path program 1 times [2025-01-10 06:57:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888012029] [2025-01-10 06:57:30,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:30,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:57:30,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:57:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:30,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:30,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:57:30,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:57:30,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:30,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:30,179 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:30,180 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:30,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:30,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:30,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:30,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:30,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:30,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:57:30,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:30,181 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:30,181 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:57:30,199 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:30,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 154 flow [2025-01-10 06:57:30,205 INFO L124 PetriNetUnfolderBase]: 5/98 cut-off events. [2025-01-10 06:57:30,205 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 06:57:30,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 98 events. 5/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 171 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 111. Up to 10 conditions per place. [2025-01-10 06:57:30,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 49 transitions, 154 flow [2025-01-10 06:57:30,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 47 transitions, 146 flow [2025-01-10 06:57:30,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:30,206 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;@3151766b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:30,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:30,207 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:30,207 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:30,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:30,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:30,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:30,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 10583671, now seen corresponding path program 1 times [2025-01-10 06:57:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181321578] [2025-01-10 06:57:30,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:30,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:30,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181321578] [2025-01-10 06:57:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181321578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:30,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:30,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619368923] [2025-01-10 06:57:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:30,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:30,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:30,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2025-01-10 06:57:30,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-10 06:57:30,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:30,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2025-01-10 06:57:30,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:30,974 INFO L124 PetriNetUnfolderBase]: 8679/13867 cut-off events. [2025-01-10 06:57:30,974 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2025-01-10 06:57:31,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26132 conditions, 13867 events. 8679/13867 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 98354 event pairs, 5971 based on Foata normal form. 0/12512 useless extension candidates. Maximal degree in co-relation 11866. Up to 11041 conditions per place. [2025-01-10 06:57:31,051 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-01-10 06:57:31,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 218 flow [2025-01-10 06:57:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 06:57:31,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7006802721088435 [2025-01-10 06:57:31,052 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 146 flow. Second operand 3 states and 103 transitions. [2025-01-10 06:57:31,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 218 flow [2025-01-10 06:57:31,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 53 transitions, 205 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:31,058 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 145 flow [2025-01-10 06:57:31,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-01-10 06:57:31,059 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2025-01-10 06:57:31,059 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 145 flow [2025-01-10 06:57:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-10 06:57:31,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:31,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:57:31,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1833832644, now seen corresponding path program 1 times [2025-01-10 06:57:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919098825] [2025-01-10 06:57:31,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:31,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:31,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919098825] [2025-01-10 06:57:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919098825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920451109] [2025-01-10 06:57:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:31,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:31,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:31,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-01-10 06:57:31,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:31,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:31,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:32,068 INFO L124 PetriNetUnfolderBase]: 11175/16355 cut-off events. [2025-01-10 06:57:32,069 INFO L125 PetriNetUnfolderBase]: For 2000/2000 co-relation queries the response was YES. [2025-01-10 06:57:32,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32042 conditions, 16355 events. 11175/16355 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 105901 event pairs, 7791 based on Foata normal form. 8/15530 useless extension candidates. Maximal degree in co-relation 14484. Up to 14209 conditions per place. [2025-01-10 06:57:32,335 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-01-10 06:57:32,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 227 flow [2025-01-10 06:57:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-01-10 06:57:32,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2025-01-10 06:57:32,337 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 145 flow. Second operand 4 states and 124 transitions. [2025-01-10 06:57:32,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 227 flow [2025-01-10 06:57:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 55 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:32,340 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 161 flow [2025-01-10 06:57:32,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-01-10 06:57:32,341 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2025-01-10 06:57:32,341 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 161 flow [2025-01-10 06:57:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-01-10 06:57:32,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:57:32,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash 53817395, now seen corresponding path program 1 times [2025-01-10 06:57:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068910965] [2025-01-10 06:57:32,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:32,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:32,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068910965] [2025-01-10 06:57:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068910965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523192170] [2025-01-10 06:57:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:32,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:32,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:32,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-01-10 06:57:32,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:32,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:32,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:33,425 INFO L124 PetriNetUnfolderBase]: 13687/19887 cut-off events. [2025-01-10 06:57:33,426 INFO L125 PetriNetUnfolderBase]: For 2184/2184 co-relation queries the response was YES. [2025-01-10 06:57:33,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39797 conditions, 19887 events. 13687/19887 cut-off events. For 2184/2184 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 130324 event pairs, 10843 based on Foata normal form. 340/19548 useless extension candidates. Maximal degree in co-relation 18016. Up to 14246 conditions per place. [2025-01-10 06:57:33,775 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 43 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-01-10 06:57:33,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 289 flow [2025-01-10 06:57:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-10 06:57:33,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836734693877551 [2025-01-10 06:57:33,777 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 161 flow. Second operand 4 states and 134 transitions. [2025-01-10 06:57:33,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 289 flow [2025-01-10 06:57:33,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:33,783 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 179 flow [2025-01-10 06:57:33,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-01-10 06:57:33,783 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2025-01-10 06:57:33,783 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 179 flow [2025-01-10 06:57:33,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-01-10 06:57:33,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:33,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:33,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:57:33,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:33,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1320440010, now seen corresponding path program 1 times [2025-01-10 06:57:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:33,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957508740] [2025-01-10 06:57:33,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:33,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:33,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:33,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:33,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:33,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957508740] [2025-01-10 06:57:33,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957508740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:33,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:33,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808504614] [2025-01-10 06:57:33,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:33,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:33,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:33,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:33,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:33,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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-01-10 06:57:33,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:33,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:33,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:35,088 INFO L124 PetriNetUnfolderBase]: 12431/18013 cut-off events. [2025-01-10 06:57:35,088 INFO L125 PetriNetUnfolderBase]: For 3812/3812 co-relation queries the response was YES. [2025-01-10 06:57:35,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39044 conditions, 18013 events. 12431/18013 cut-off events. For 3812/3812 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 115077 event pairs, 4311 based on Foata normal form. 336/18184 useless extension candidates. Maximal degree in co-relation 24717. Up to 12640 conditions per place. [2025-01-10 06:57:35,255 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 38 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-01-10 06:57:35,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 289 flow [2025-01-10 06:57:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-01-10 06:57:35,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-01-10 06:57:35,257 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 179 flow. Second operand 6 states and 174 transitions. [2025-01-10 06:57:35,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 289 flow [2025-01-10 06:57:35,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 64 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:35,323 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 183 flow [2025-01-10 06:57:35,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2025-01-10 06:57:35,324 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 12 predicate places. [2025-01-10 06:57:35,324 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 183 flow [2025-01-10 06:57:35,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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-01-10 06:57:35,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:35,324 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:35,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:57:35,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:35,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1251545721, now seen corresponding path program 1 times [2025-01-10 06:57:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006234664] [2025-01-10 06:57:35,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:35,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:35,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:35,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:35,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006234664] [2025-01-10 06:57:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006234664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:35,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:35,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962385752] [2025-01-10 06:57:35,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:35,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:35,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:35,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:35,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:35,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-01-10 06:57:35,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:35,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:35,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:36,367 INFO L124 PetriNetUnfolderBase]: 12411/18243 cut-off events. [2025-01-10 06:57:36,367 INFO L125 PetriNetUnfolderBase]: For 4378/4378 co-relation queries the response was YES. [2025-01-10 06:57:36,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39543 conditions, 18243 events. 12411/18243 cut-off events. For 4378/4378 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 119050 event pairs, 5407 based on Foata normal form. 4/17930 useless extension candidates. Maximal degree in co-relation 25656. Up to 15585 conditions per place. [2025-01-10 06:57:36,522 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 40 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-01-10 06:57:36,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 65 transitions, 311 flow [2025-01-10 06:57:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-01-10 06:57:36,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6244897959183674 [2025-01-10 06:57:36,524 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 183 flow. Second operand 5 states and 153 transitions. [2025-01-10 06:57:36,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 65 transitions, 311 flow [2025-01-10 06:57:36,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 65 transitions, 296 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:36,566 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 190 flow [2025-01-10 06:57:36,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2025-01-10 06:57:36,566 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2025-01-10 06:57:36,567 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 190 flow [2025-01-10 06:57:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-01-10 06:57:36,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:36,567 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:36,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:57:36,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:36,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2016032298, now seen corresponding path program 1 times [2025-01-10 06:57:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137592767] [2025-01-10 06:57:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:36,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:36,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:36,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:36,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137592767] [2025-01-10 06:57:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137592767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374633677] [2025-01-10 06:57:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:36,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:36,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:36,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:36,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:36,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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-01-10 06:57:36,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:36,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:36,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:37,809 INFO L124 PetriNetUnfolderBase]: 12379/18193 cut-off events. [2025-01-10 06:57:37,809 INFO L125 PetriNetUnfolderBase]: For 4222/4222 co-relation queries the response was YES. [2025-01-10 06:57:37,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39445 conditions, 18193 events. 12379/18193 cut-off events. For 4222/4222 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 118739 event pairs, 5375 based on Foata normal form. 16/17900 useless extension candidates. Maximal degree in co-relation 25558. Up to 15585 conditions per place. [2025-01-10 06:57:37,983 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 42 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2025-01-10 06:57:37,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 68 transitions, 320 flow [2025-01-10 06:57:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-01-10 06:57:37,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-01-10 06:57:37,985 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 190 flow. Second operand 6 states and 178 transitions. [2025-01-10 06:57:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 68 transitions, 320 flow [2025-01-10 06:57:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:38,028 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 206 flow [2025-01-10 06:57:38,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2025-01-10 06:57:38,028 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2025-01-10 06:57:38,028 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 206 flow [2025-01-10 06:57:38,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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-01-10 06:57:38,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:38,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:38,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:57:38,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:38,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -453910605, now seen corresponding path program 1 times [2025-01-10 06:57:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951331016] [2025-01-10 06:57:38,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:38,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:57:38,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:57:38,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:38,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951331016] [2025-01-10 06:57:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951331016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065485661] [2025-01-10 06:57:38,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:38,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:57:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:38,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:57:38,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:57:38,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:38,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 52 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-10 06:57:38,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:38,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:38,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:39,357 INFO L124 PetriNetUnfolderBase]: 12235/17921 cut-off events. [2025-01-10 06:57:39,357 INFO L125 PetriNetUnfolderBase]: For 5422/5422 co-relation queries the response was YES. [2025-01-10 06:57:39,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39499 conditions, 17921 events. 12235/17921 cut-off events. For 5422/5422 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 116479 event pairs, 2431 based on Foata normal form. 16/17628 useless extension candidates. Maximal degree in co-relation 26106. Up to 14337 conditions per place. [2025-01-10 06:57:39,451 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 52 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2025-01-10 06:57:39,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 79 transitions, 388 flow [2025-01-10 06:57:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:57:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:57:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2025-01-10 06:57:39,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6151603498542274 [2025-01-10 06:57:39,452 INFO L175 Difference]: Start difference. First operand has 81 places, 52 transitions, 206 flow. Second operand 7 states and 211 transitions. [2025-01-10 06:57:39,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 79 transitions, 388 flow [2025-01-10 06:57:39,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 380 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:39,486 INFO L231 Difference]: Finished difference. Result has 84 places, 53 transitions, 222 flow [2025-01-10 06:57:39,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=84, PETRI_TRANSITIONS=53} [2025-01-10 06:57:39,487 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 20 predicate places. [2025-01-10 06:57:39,487 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 53 transitions, 222 flow [2025-01-10 06:57:39,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-10 06:57:39,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:39,487 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:39,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:57:39,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:39,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 978055386, now seen corresponding path program 1 times [2025-01-10 06:57:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:39,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631918737] [2025-01-10 06:57:39,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:57:39,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:57:39,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:39,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:39,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631918737] [2025-01-10 06:57:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631918737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490100946] [2025-01-10 06:57:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:57:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:39,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:57:39,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:39,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:39,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 53 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 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-01-10 06:57:39,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:39,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:39,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:40,560 INFO L124 PetriNetUnfolderBase]: 12043/17665 cut-off events. [2025-01-10 06:57:40,560 INFO L125 PetriNetUnfolderBase]: For 6486/6486 co-relation queries the response was YES. [2025-01-10 06:57:40,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39580 conditions, 17665 events. 12043/17665 cut-off events. For 6486/6486 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 114790 event pairs, 2303 based on Foata normal form. 64/17452 useless extension candidates. Maximal degree in co-relation 26186. Up to 14337 conditions per place. [2025-01-10 06:57:40,696 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 56 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-01-10 06:57:40,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 84 transitions, 414 flow [2025-01-10 06:57:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:57:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:57:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2025-01-10 06:57:40,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-10 06:57:40,698 INFO L175 Difference]: Start difference. First operand has 84 places, 53 transitions, 222 flow. Second operand 8 states and 238 transitions. [2025-01-10 06:57:40,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 84 transitions, 414 flow [2025-01-10 06:57:40,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 402 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:40,737 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 238 flow [2025-01-10 06:57:40,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=88, PETRI_TRANSITIONS=54} [2025-01-10 06:57:40,738 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 24 predicate places. [2025-01-10 06:57:40,738 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 238 flow [2025-01-10 06:57:40,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 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-01-10 06:57:40,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:40,738 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:40,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:57:40,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1300738999, now seen corresponding path program 1 times [2025-01-10 06:57:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195520489] [2025-01-10 06:57:40,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:40,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:57:40,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:57:40,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:40,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:40,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195520489] [2025-01-10 06:57:40,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195520489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:57:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34642165] [2025-01-10 06:57:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:40,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:57:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:57:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:57:40,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:40,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 54 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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-01-10 06:57:40,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:40,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:40,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:41,781 INFO L124 PetriNetUnfolderBase]: 11211/16289 cut-off events. [2025-01-10 06:57:41,782 INFO L125 PetriNetUnfolderBase]: For 8166/8166 co-relation queries the response was YES. [2025-01-10 06:57:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37070 conditions, 16289 events. 11211/16289 cut-off events. For 8166/8166 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 102336 event pairs, 1023 based on Foata normal form. 64/16076 useless extension candidates. Maximal degree in co-relation 26042. Up to 6657 conditions per place. [2025-01-10 06:57:41,925 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 63 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2025-01-10 06:57:41,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 460 flow [2025-01-10 06:57:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:57:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:57:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 269 transitions. [2025-01-10 06:57:41,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6099773242630385 [2025-01-10 06:57:41,928 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 238 flow. Second operand 9 states and 269 transitions. [2025-01-10 06:57:41,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 460 flow [2025-01-10 06:57:41,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 446 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:57:41,964 INFO L231 Difference]: Finished difference. Result has 92 places, 55 transitions, 254 flow [2025-01-10 06:57:41,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=254, PETRI_PLACES=92, PETRI_TRANSITIONS=55} [2025-01-10 06:57:41,969 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 28 predicate places. [2025-01-10 06:57:41,969 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 55 transitions, 254 flow [2025-01-10 06:57:41,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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-01-10 06:57:41,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:41,969 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:57:41,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -433722796, now seen corresponding path program 1 times [2025-01-10 06:57:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131700758] [2025-01-10 06:57:41,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:41,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:57:41,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:57:41,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:41,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:42,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131700758] [2025-01-10 06:57:42,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131700758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:42,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:57:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708644075] [2025-01-10 06:57:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:57:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:42,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:57:42,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:57:42,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:42,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 55 transitions, 254 flow. Second operand has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 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-01-10 06:57:42,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:42,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:42,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:43,025 INFO L124 PetriNetUnfolderBase]: 10187/15033 cut-off events. [2025-01-10 06:57:43,025 INFO L125 PetriNetUnfolderBase]: For 10534/10534 co-relation queries the response was YES. [2025-01-10 06:57:43,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35133 conditions, 15033 events. 10187/15033 cut-off events. For 10534/10534 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 95670 event pairs, 255 based on Foata normal form. 256/15140 useless extension candidates. Maximal degree in co-relation 24104. Up to 7937 conditions per place. [2025-01-10 06:57:43,136 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 70 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2025-01-10 06:57:43,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 502 flow [2025-01-10 06:57:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 298 transitions. [2025-01-10 06:57:43,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081632653061224 [2025-01-10 06:57:43,141 INFO L175 Difference]: Start difference. First operand has 92 places, 55 transitions, 254 flow. Second operand 10 states and 298 transitions. [2025-01-10 06:57:43,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 502 flow [2025-01-10 06:57:43,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 100 transitions, 480 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-10 06:57:43,196 INFO L231 Difference]: Finished difference. Result has 91 places, 54 transitions, 242 flow [2025-01-10 06:57:43,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=242, PETRI_PLACES=91, PETRI_TRANSITIONS=54} [2025-01-10 06:57:43,197 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 27 predicate places. [2025-01-10 06:57:43,197 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 54 transitions, 242 flow [2025-01-10 06:57:43,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 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-01-10 06:57:43,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:43,197 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:43,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:57:43,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:43,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -195768357, now seen corresponding path program 1 times [2025-01-10 06:57:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230777566] [2025-01-10 06:57:43,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:43,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:57:43,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:57:43,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230777566] [2025-01-10 06:57:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230777566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:57:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919194884] [2025-01-10 06:57:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:43,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:57:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:43,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:57:43,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:57:43,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:43,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 54 transitions, 242 flow. Second operand has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 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-01-10 06:57:43,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:43,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:43,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:44,141 INFO L124 PetriNetUnfolderBase]: 9163/13345 cut-off events. [2025-01-10 06:57:44,141 INFO L125 PetriNetUnfolderBase]: For 8068/8068 co-relation queries the response was YES. [2025-01-10 06:57:44,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31631 conditions, 13345 events. 9163/13345 cut-off events. For 8068/8068 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 80746 event pairs, 255 based on Foata normal form. 256/13452 useless extension candidates. Maximal degree in co-relation 20604. Up to 6656 conditions per place. [2025-01-10 06:57:44,241 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 69 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2025-01-10 06:57:44,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 484 flow [2025-01-10 06:57:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:57:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:57:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 319 transitions. [2025-01-10 06:57:44,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-01-10 06:57:44,242 INFO L175 Difference]: Start difference. First operand has 91 places, 54 transitions, 242 flow. Second operand 11 states and 319 transitions. [2025-01-10 06:57:44,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 484 flow [2025-01-10 06:57:44,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 444 flow, removed 2 selfloop flow, removed 14 redundant places. [2025-01-10 06:57:44,271 INFO L231 Difference]: Finished difference. Result has 86 places, 52 transitions, 208 flow [2025-01-10 06:57:44,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=208, PETRI_PLACES=86, PETRI_TRANSITIONS=52} [2025-01-10 06:57:44,272 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 22 predicate places. [2025-01-10 06:57:44,272 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 52 transitions, 208 flow [2025-01-10 06:57:44,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 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-01-10 06:57:44,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:44,272 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:44,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:57:44,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash 402336177, now seen corresponding path program 1 times [2025-01-10 06:57:44,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:44,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165760576] [2025-01-10 06:57:44,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:44,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:44,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:57:44,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:57:44,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:44,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165760576] [2025-01-10 06:57:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165760576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109101139] [2025-01-10 06:57:44,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:44,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:44,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:44,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:44,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:57:44,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:57:44,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:57:44,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:44,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:44,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:44,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:44,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109101139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938802520] [2025-01-10 06:57:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:44,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:44,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:44,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:44,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:44,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 52 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-01-10 06:57:44,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:44,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:44,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:45,214 INFO L124 PetriNetUnfolderBase]: 10187/14275 cut-off events. [2025-01-10 06:57:45,214 INFO L125 PetriNetUnfolderBase]: For 4828/4828 co-relation queries the response was YES. [2025-01-10 06:57:45,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32313 conditions, 14275 events. 10187/14275 cut-off events. For 4828/4828 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 83391 event pairs, 4811 based on Foata normal form. 256/13936 useless extension candidates. Maximal degree in co-relation 19498. Up to 6258 conditions per place. [2025-01-10 06:57:45,324 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 60 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2025-01-10 06:57:45,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 83 transitions, 398 flow [2025-01-10 06:57:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2025-01-10 06:57:45,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-01-10 06:57:45,325 INFO L175 Difference]: Start difference. First operand has 86 places, 52 transitions, 208 flow. Second operand 6 states and 192 transitions. [2025-01-10 06:57:45,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 83 transitions, 398 flow [2025-01-10 06:57:45,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 381 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-10 06:57:45,352 INFO L231 Difference]: Finished difference. Result has 81 places, 51 transitions, 197 flow [2025-01-10 06:57:45,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=81, PETRI_TRANSITIONS=51} [2025-01-10 06:57:45,353 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2025-01-10 06:57:45,353 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 51 transitions, 197 flow [2025-01-10 06:57:45,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-01-10 06:57:45,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:45,353 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:45,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:57:45,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:45,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:45,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash -412480066, now seen corresponding path program 1 times [2025-01-10 06:57:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704428321] [2025-01-10 06:57:45,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:45,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:57:45,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:57:45,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:45,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:45,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:45,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704428321] [2025-01-10 06:57:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704428321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:45,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792182622] [2025-01-10 06:57:45,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:45,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:45,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:45,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:57:45,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:57:45,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:57:45,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:45,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:45,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:45,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792182622] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:45,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834763704] [2025-01-10 06:57:45,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:45,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:45,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:45,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:45,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:45,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 51 transitions, 197 flow. Second operand has 12 states, 12 states have (on average 24.166666666666668) internal successors, (290), 12 states have internal predecessors, (290), 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-01-10 06:57:45,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:45,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:45,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:47,136 INFO L124 PetriNetUnfolderBase]: 16331/22723 cut-off events. [2025-01-10 06:57:47,137 INFO L125 PetriNetUnfolderBase]: For 8674/8674 co-relation queries the response was YES. [2025-01-10 06:57:47,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52368 conditions, 22723 events. 16331/22723 cut-off events. For 8674/8674 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 136378 event pairs, 7883 based on Foata normal form. 768/23152 useless extension candidates. Maximal degree in co-relation 24040. Up to 10354 conditions per place. [2025-01-10 06:57:47,308 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 94 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-01-10 06:57:47,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 567 flow [2025-01-10 06:57:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 320 transitions. [2025-01-10 06:57:47,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-01-10 06:57:47,309 INFO L175 Difference]: Start difference. First operand has 81 places, 51 transitions, 197 flow. Second operand 10 states and 320 transitions. [2025-01-10 06:57:47,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 567 flow [2025-01-10 06:57:47,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 541 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:47,352 INFO L231 Difference]: Finished difference. Result has 88 places, 57 transitions, 241 flow [2025-01-10 06:57:47,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=241, PETRI_PLACES=88, PETRI_TRANSITIONS=57} [2025-01-10 06:57:47,353 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 24 predicate places. [2025-01-10 06:57:47,353 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 57 transitions, 241 flow [2025-01-10 06:57:47,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.166666666666668) internal successors, (290), 12 states have internal predecessors, (290), 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-01-10 06:57:47,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:47,353 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:47,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:57:47,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:47,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:47,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 476406836, now seen corresponding path program 2 times [2025-01-10 06:57:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:47,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535783399] [2025-01-10 06:57:47,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:47,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:47,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:57:47,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 45 statements. [2025-01-10 06:57:47,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:47,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:47,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535783399] [2025-01-10 06:57:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535783399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769761539] [2025-01-10 06:57:47,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:47,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:47,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:47,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:47,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:57:47,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:57:47,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 45 statements. [2025-01-10 06:57:47,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:47,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:47,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:57:47,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:47,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769761539] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:47,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:47,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-01-10 06:57:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168916083] [2025-01-10 06:57:47,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:47,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:47,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:47,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:47,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:47,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:47,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 57 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-01-10 06:57:47,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:47,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:47,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:48,853 INFO L124 PetriNetUnfolderBase]: 15307/21443 cut-off events. [2025-01-10 06:57:48,853 INFO L125 PetriNetUnfolderBase]: For 12258/12258 co-relation queries the response was YES. [2025-01-10 06:57:48,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49810 conditions, 21443 events. 15307/21443 cut-off events. For 12258/12258 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 129681 event pairs, 9931 based on Foata normal form. 256/21360 useless extension candidates. Maximal degree in co-relation 38785. Up to 12913 conditions per place. [2025-01-10 06:57:48,994 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 0 selfloop transitions, 0 changer transitions 64/64 dead transitions. [2025-01-10 06:57:48,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 64 transitions, 339 flow [2025-01-10 06:57:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-01-10 06:57:48,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-01-10 06:57:48,995 INFO L175 Difference]: Start difference. First operand has 88 places, 57 transitions, 241 flow. Second operand 4 states and 121 transitions. [2025-01-10 06:57:48,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 64 transitions, 339 flow [2025-01-10 06:57:49,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 64 transitions, 319 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-10 06:57:49,089 INFO L231 Difference]: Finished difference. Result has 84 places, 0 transitions, 0 flow [2025-01-10 06:57:49,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=84, PETRI_TRANSITIONS=0} [2025-01-10 06:57:49,090 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 20 predicate places. [2025-01-10 06:57:49,090 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 0 transitions, 0 flow [2025-01-10 06:57:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-01-10 06:57:49,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 06:57:49,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:49,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:49,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:49,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 06:57:49,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:49,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:57:49,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:49,291 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:49,292 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-01-10 06:57:49,292 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:57:49,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:57:49 BasicIcfg [2025-01-10 06:57:49,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:57:49,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:57:49,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:57:49,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:57:49,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:25" (3/4) ... [2025-01-10 06:57:49,300 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:57:49,302 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f1 [2025-01-10 06:57:49,302 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f2 [2025-01-10 06:57:49,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-01-10 06:57:49,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 06:57:49,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:57:49,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:57:49,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:57:49,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:57:49,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:57:49,357 INFO L158 Benchmark]: Toolchain (without parser) took 24668.35ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 130.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-01-10 06:57:49,357 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:49,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.09ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 110.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:57:49,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.66ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:57:49,357 INFO L158 Benchmark]: Boogie Preprocessor took 35.67ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:49,357 INFO L158 Benchmark]: RCFGBuilder took 380.63ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 86.5MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:57:49,358 INFO L158 Benchmark]: TraceAbstraction took 23888.51ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 86.1MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-01-10 06:57:49,358 INFO L158 Benchmark]: Witness Printer took 57.98ms. Allocated memory is still 3.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:57:49,359 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.09ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 110.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.66ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.67ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 380.63ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 86.5MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23888.51ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 86.1MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 57.98ms. Allocated memory is still 3.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 779]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 779]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: 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 5 procedures, 34 locations, 6 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: 0.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=1, InterpolantAutomatonStates: 7, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 42 locations, 6 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: 1.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 3 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=5, InterpolantAutomatonStates: 28, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2/2 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 50 locations, 6 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: 3.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 739 IncrementalHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 13 mSDtfsCounter, 739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=7, InterpolantAutomatonStates: 43, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 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 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 11 procedures, 58 locations, 6 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: 19.1s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2235 IncrementalHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 19 mSDtfsCounter, 2235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=9, InterpolantAutomatonStates: 93, 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, 0.9s InterpolantComputationTime, 428 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1334 SizeOfPredicates, 7 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 74/109 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-01-10 06:57:49,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE