./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:25:30,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:25:30,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:25:30,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:25:30,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:25:30,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:25:30,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:25:30,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:25:30,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:25:30,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:25:30,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:25:30,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:25:30,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:25:30,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:25:30,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:25:30,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:25:30,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:25:30,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:25:30,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:25:30,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:25:30,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:25:30,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:25:30,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:25:30,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:25:30,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:25:30,164 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-17 19:25:30,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:25:30,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:25:30,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:25:30,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:25:30,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:25:30,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-17 19:25:31,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395a84cb1/1315cc06a4e04d549490f1b854173486/FLAG7f3e4cf9b [2025-03-17 19:25:31,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:25:31,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-17 19:25:31,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395a84cb1/1315cc06a4e04d549490f1b854173486/FLAG7f3e4cf9b [2025-03-17 19:25:32,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395a84cb1/1315cc06a4e04d549490f1b854173486 [2025-03-17 19:25:32,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:25:32,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:25:32,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:25:32,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:25:32,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:25:32,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c913def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32, skipping insertion in model container [2025-03-17 19:25:32,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:25:32,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:25:32,367 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:25:32,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:25:32,430 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:25:32,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32 WrapperNode [2025-03-17 19:25:32,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:25:32,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:25:32,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:25:32,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:25:32,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,460 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-03-17 19:25:32,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:25:32,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:25:32,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:25:32,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:25:32,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,484 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-17 19:25:32,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:25:32,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:25:32,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:25:32,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:25:32,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (1/1) ... [2025-03-17 19:25:32,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:25:32,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:32,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:25:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:25:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:25:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:25:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:25:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 19:25:32,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 19:25:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:25:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:25:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:25:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:25:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:25:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:25:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:25:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:25:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:25:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:25:32,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:25:32,549 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:25:32,652 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:25:32,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:25:32,856 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:25:32,856 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:25:32,966 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:25:32,967 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:25:32,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:25:32 BoogieIcfgContainer [2025-03-17 19:25:32,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:25:32,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:25:32,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:25:32,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:25:32,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:25:32" (1/3) ... [2025-03-17 19:25:32,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c13b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:25:32, skipping insertion in model container [2025-03-17 19:25:32,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:25:32" (2/3) ... [2025-03-17 19:25:32,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c13b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:25:32, skipping insertion in model container [2025-03-17 19:25:32,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:25:32" (3/3) ... [2025-03-17 19:25:32,977 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-17 19:25:32,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:25:32,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 19:25:32,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:25:33,024 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:25:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 70 flow [2025-03-17 19:25:33,076 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-03-17 19:25:33,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:25:33,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-17 19:25:33,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 33 transitions, 70 flow [2025-03-17 19:25:33,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 33 transitions, 70 flow [2025-03-17 19:25:33,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:25:33,110 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;@240a1ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:25:33,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 19:25:33,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:25:33,115 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:25:33,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:25:33,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:33,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:25:33,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:33,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash 243422, now seen corresponding path program 1 times [2025-03-17 19:25:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-03-17 19:25:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:33,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:25:33,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:25:33,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:33,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:33,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-03-17 19:25:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510398535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:33,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488761216] [2025-03-17 19:25:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:33,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:25:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:33,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:25:33,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:25:33,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 19:25:33,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 70 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-03-17 19:25:33,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:33,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 19:25:33,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:33,436 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-17 19:25:33,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:25:33,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 88 events. 24/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs, 20 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 127. Up to 64 conditions per place. [2025-03-17 19:25:33,438 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 19 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-17 19:25:33,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 114 flow [2025-03-17 19:25:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:25:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:25:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-17 19:25:33,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-03-17 19:25:33,447 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 70 flow. Second operand 4 states and 71 transitions. [2025-03-17 19:25:33,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 114 flow [2025-03-17 19:25:33,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:25:33,451 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 90 flow [2025-03-17 19:25:33,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-17 19:25:33,455 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-03-17 19:25:33,455 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 90 flow [2025-03-17 19:25:33,455 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-03-17 19:25:33,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:33,456 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:25:33,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:25:33,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:33,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1337956340, now seen corresponding path program 1 times [2025-03-17 19:25:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-03-17 19:25:33,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:33,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:25:33,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:25:33,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:33,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-03-17 19:25:33,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977235876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190070091] [2025-03-17 19:25:33,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:33,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:33,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:33,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:33,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:25:33,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:25:33,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:25:33,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:33,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:25:33,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:33,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:25:33,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190070091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:25:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:25:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370294448] [2025-03-17 19:25:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:25:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:33,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:25:33,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:25:33,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 19:25:33,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:33,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:33,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 19:25:33,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:33,794 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-03-17 19:25:33,795 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:25:33,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 87 events. 24/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 20 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 150. Up to 59 conditions per place. [2025-03-17 19:25:33,796 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 15 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-03-17 19:25:33,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 128 flow [2025-03-17 19:25:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:25:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:25:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-17 19:25:33,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-17 19:25:33,797 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 90 flow. Second operand 6 states and 88 transitions. [2025-03-17 19:25:33,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 128 flow [2025-03-17 19:25:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:25:33,798 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 96 flow [2025-03-17 19:25:33,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-17 19:25:33,798 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-17 19:25:33,798 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 96 flow [2025-03-17 19:25:33,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:33,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:33,799 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:25:33,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:25:33,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:34,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1473026613, now seen corresponding path program 1 times [2025-03-17 19:25:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066578656] [2025-03-17 19:25:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:25:34,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:25:34,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:34,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:25:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066578656] [2025-03-17 19:25:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066578656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890172531] [2025-03-17 19:25:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:34,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:34,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:34,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:34,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 19:25:34,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:34,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:34,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 19:25:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:34,097 INFO L124 PetriNetUnfolderBase]: 24/86 cut-off events. [2025-03-17 19:25:34,097 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 19:25:34,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 86 events. 24/86 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 20 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 146. Up to 62 conditions per place. [2025-03-17 19:25:34,098 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 16 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-03-17 19:25:34,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 132 flow [2025-03-17 19:25:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-17 19:25:34,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-03-17 19:25:34,099 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 96 flow. Second operand 3 states and 52 transitions. [2025-03-17 19:25:34,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 132 flow [2025-03-17 19:25:34,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 110 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 19:25:34,100 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 78 flow [2025-03-17 19:25:34,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-03-17 19:25:34,101 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-17 19:25:34,101 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 78 flow [2025-03-17 19:25:34,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:34,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:34,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:34,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:25:34,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1760149466, now seen corresponding path program 1 times [2025-03-17 19:25:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608178899] [2025-03-17 19:25:34,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:34,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:25:34,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:25:34,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:34,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608178899] [2025-03-17 19:25:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608178899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036489536] [2025-03-17 19:25:34,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:34,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:34,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:25:34,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:25:34,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:25:34,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:34,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:34,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:25:34,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:34,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:25:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:34,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036489536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:25:34,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:25:34,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 19:25:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69518914] [2025-03-17 19:25:34,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:25:34,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:25:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:34,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:25:34,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:25:34,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 19:25:34,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:34,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:34,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 19:25:34,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:34,390 INFO L124 PetriNetUnfolderBase]: 24/90 cut-off events. [2025-03-17 19:25:34,390 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 19:25:34,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 90 events. 24/90 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 177 event pairs, 20 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 139. Up to 60 conditions per place. [2025-03-17 19:25:34,391 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-03-17 19:25:34,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 139 flow [2025-03-17 19:25:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:25:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:25:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-03-17 19:25:34,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-17 19:25:34,392 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 78 flow. Second operand 7 states and 102 transitions. [2025-03-17 19:25:34,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 139 flow [2025-03-17 19:25:34,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:34,393 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 104 flow [2025-03-17 19:25:34,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-03-17 19:25:34,394 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-17 19:25:34,394 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 104 flow [2025-03-17 19:25:34,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:34,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:34,394 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:34,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 19:25:34,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 19:25:34,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:34,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:34,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1515559270, now seen corresponding path program 2 times [2025-03-17 19:25:34,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-03-17 19:25:34,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:25:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:34,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:25:34,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-17 19:25:34,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:25:34,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:25:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-03-17 19:25:34,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844143637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:34,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:34,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647159618] [2025-03-17 19:25:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:34,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:34,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:34,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 19:25:34,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:34,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:34,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 19:25:34,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:34,728 INFO L124 PetriNetUnfolderBase]: 26/97 cut-off events. [2025-03-17 19:25:34,729 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 19:25:34,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 97 events. 26/97 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 198 event pairs, 2 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 153. Up to 53 conditions per place. [2025-03-17 19:25:34,730 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-17 19:25:34,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 158 flow [2025-03-17 19:25:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-17 19:25:34,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-17 19:25:34,731 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 104 flow. Second operand 3 states and 55 transitions. [2025-03-17 19:25:34,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 158 flow [2025-03-17 19:25:34,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:34,732 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2025-03-17 19:25:34,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-03-17 19:25:34,733 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-17 19:25:34,733 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2025-03-17 19:25:34,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:34,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:34,734 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 19:25:34,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:25:34,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:34,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -262329324, now seen corresponding path program 1 times [2025-03-17 19:25:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405512241] [2025-03-17 19:25:34,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:34,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:25:34,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:25:34,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:34,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405512241] [2025-03-17 19:25:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405512241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107044968] [2025-03-17 19:25:34,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:34,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:34,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:34,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:25:34,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:25:34,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:25:34,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:34,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:25:34,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:34,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:25:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107044968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:25:35,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:25:35,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 19:25:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165263370] [2025-03-17 19:25:35,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:25:35,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:25:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:35,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:25:35,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:25:35,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 19:25:35,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:35,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:35,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 19:25:35,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:35,158 INFO L124 PetriNetUnfolderBase]: 24/98 cut-off events. [2025-03-17 19:25:35,158 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 19:25:35,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 98 events. 24/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 20 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 146. Up to 60 conditions per place. [2025-03-17 19:25:35,159 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 13 changer transitions 0/39 dead transitions. [2025-03-17 19:25:35,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 196 flow [2025-03-17 19:25:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:25:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:25:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2025-03-17 19:25:35,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40792540792540793 [2025-03-17 19:25:35,160 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 13 states and 175 transitions. [2025-03-17 19:25:35,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 196 flow [2025-03-17 19:25:35,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:35,162 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 175 flow [2025-03-17 19:25:35,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-03-17 19:25:35,162 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2025-03-17 19:25:35,162 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 175 flow [2025-03-17 19:25:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:35,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:35,163 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-03-17 19:25:35,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 19:25:35,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:35,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-17 19:25:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 733159142, now seen corresponding path program 2 times [2025-03-17 19:25:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999530451] [2025-03-17 19:25:35,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:25:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:35,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 19:25:35,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:25:35,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:25:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:25:35,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:25:35,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:25:35,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:25:35,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:35,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:25:35,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:25:35,414 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:25:35,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-17 19:25:35,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-17 19:25:35,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-17 19:25:35,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:25:35,417 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-17 19:25:35,419 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:25:35,419 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 19:25:35,432 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:25:35,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 120 flow [2025-03-17 19:25:35,438 INFO L124 PetriNetUnfolderBase]: 5/60 cut-off events. [2025-03-17 19:25:35,439 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:25:35,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 60 events. 5/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-03-17 19:25:35,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 120 flow [2025-03-17 19:25:35,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 120 flow [2025-03-17 19:25:35,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:25:35,444 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;@240a1ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:25:35,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 19:25:35,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:25:35,445 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:25:35,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:25:35,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:35,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:25:35,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:35,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash 298037, now seen corresponding path program 1 times [2025-03-17 19:25:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:35,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751492715] [2025-03-17 19:25:35,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:35,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:35,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:25:35,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:25:35,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751492715] [2025-03-17 19:25:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751492715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482675321] [2025-03-17 19:25:35,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:35,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:25:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:35,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:25:35,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:25:35,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:35,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:35,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:35,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:35,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:35,630 INFO L124 PetriNetUnfolderBase]: 640/1344 cut-off events. [2025-03-17 19:25:35,630 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 19:25:35,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1344 events. 640/1344 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7590 event pairs, 570 based on Foata normal form. 70/1297 useless extension candidates. Maximal degree in co-relation 1594. Up to 1043 conditions per place. [2025-03-17 19:25:35,636 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 31 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-03-17 19:25:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 186 flow [2025-03-17 19:25:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:25:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:25:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-17 19:25:35,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-17 19:25:35,637 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 120 flow. Second operand 4 states and 120 transitions. [2025-03-17 19:25:35,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 186 flow [2025-03-17 19:25:35,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:25:35,638 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 138 flow [2025-03-17 19:25:35,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-17 19:25:35,639 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-03-17 19:25:35,639 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 138 flow [2025-03-17 19:25:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:35,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:35,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:25:35,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:25:35,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:35,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash 289133740, now seen corresponding path program 1 times [2025-03-17 19:25:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803406584] [2025-03-17 19:25:35,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:25:35,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:25:35,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:35,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803406584] [2025-03-17 19:25:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803406584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831089858] [2025-03-17 19:25:35,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:35,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:35,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:35,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:25:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:25:35,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:25:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:35,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:25:35,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:35,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:25:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831089858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:25:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:25:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880506046] [2025-03-17 19:25:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:25:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:35,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:25:35,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:25:35,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:35,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:35,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:35,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:35,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:35,937 INFO L124 PetriNetUnfolderBase]: 640/1343 cut-off events. [2025-03-17 19:25:35,937 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 19:25:35,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1343 events. 640/1343 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7604 event pairs, 570 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 2418. Up to 1038 conditions per place. [2025-03-17 19:25:35,946 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-03-17 19:25:35,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 200 flow [2025-03-17 19:25:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:25:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:25:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-17 19:25:35,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-17 19:25:35,947 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 138 flow. Second operand 6 states and 154 transitions. [2025-03-17 19:25:35,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 200 flow [2025-03-17 19:25:35,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:25:35,949 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 144 flow [2025-03-17 19:25:35,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-03-17 19:25:35,949 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-03-17 19:25:35,949 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 144 flow [2025-03-17 19:25:35,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:35,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:35,949 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:25:35,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:25:36,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:36,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:36,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash 373211596, now seen corresponding path program 1 times [2025-03-17 19:25:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156171832] [2025-03-17 19:25:36,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:36,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:25:36,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:25:36,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:36,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:25:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156171832] [2025-03-17 19:25:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156171832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250176371] [2025-03-17 19:25:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:36,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:36,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:36,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:36,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:36,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:36,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:36,278 INFO L124 PetriNetUnfolderBase]: 640/1342 cut-off events. [2025-03-17 19:25:36,279 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 19:25:36,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1342 events. 640/1342 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7562 event pairs, 570 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 2414. Up to 1041 conditions per place. [2025-03-17 19:25:36,285 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-03-17 19:25:36,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 204 flow [2025-03-17 19:25:36,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-17 19:25:36,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-03-17 19:25:36,286 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 144 flow. Second operand 3 states and 91 transitions. [2025-03-17 19:25:36,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 204 flow [2025-03-17 19:25:36,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 182 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 19:25:36,288 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 126 flow [2025-03-17 19:25:36,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-17 19:25:36,289 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-03-17 19:25:36,289 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 126 flow [2025-03-17 19:25:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:36,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:36,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:36,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:25:36,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2120403374, now seen corresponding path program 1 times [2025-03-17 19:25:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:36,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145921438] [2025-03-17 19:25:36,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:36,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:25:36,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:25:36,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:36,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145921438] [2025-03-17 19:25:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145921438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100619302] [2025-03-17 19:25:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:36,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:36,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:36,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:25:36,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:25:36,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:25:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:36,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:36,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:25:36,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:36,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:25:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100619302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:25:36,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:25:36,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 19:25:36,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920102699] [2025-03-17 19:25:36,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:25:36,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:25:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:36,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:25:36,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:25:36,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:36,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:36,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:36,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:36,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:36,602 INFO L124 PetriNetUnfolderBase]: 640/1346 cut-off events. [2025-03-17 19:25:36,603 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-17 19:25:36,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1346 events. 640/1346 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7596 event pairs, 570 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 2407. Up to 1039 conditions per place. [2025-03-17 19:25:36,609 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-17 19:25:36,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 211 flow [2025-03-17 19:25:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:25:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:25:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-17 19:25:36,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4597402597402597 [2025-03-17 19:25:36,612 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 126 flow. Second operand 7 states and 177 transitions. [2025-03-17 19:25:36,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 211 flow [2025-03-17 19:25:36,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:36,614 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 152 flow [2025-03-17 19:25:36,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-03-17 19:25:36,615 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2025-03-17 19:25:36,615 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 152 flow [2025-03-17 19:25:36,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:36,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:36,616 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:36,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:25:36,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 19:25:36,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:36,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2011256562, now seen corresponding path program 2 times [2025-03-17 19:25:36,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:36,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380826140] [2025-03-17 19:25:36,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:25:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:36,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:25:36,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-17 19:25:36,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:25:36,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:25:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380826140] [2025-03-17 19:25:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380826140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:36,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778622264] [2025-03-17 19:25:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:36,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:36,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:36,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:36,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:36,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:36,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:36,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:36,965 INFO L124 PetriNetUnfolderBase]: 698/1432 cut-off events. [2025-03-17 19:25:36,965 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-17 19:25:36,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1432 events. 698/1432 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8043 event pairs, 291 based on Foata normal form. 36/1390 useless extension candidates. Maximal degree in co-relation 2592. Up to 976 conditions per place. [2025-03-17 19:25:36,971 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-17 19:25:36,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 283 flow [2025-03-17 19:25:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-17 19:25:36,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-03-17 19:25:36,972 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 152 flow. Second operand 3 states and 106 transitions. [2025-03-17 19:25:36,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 283 flow [2025-03-17 19:25:36,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:36,973 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 150 flow [2025-03-17 19:25:36,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-03-17 19:25:36,974 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-03-17 19:25:36,974 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 150 flow [2025-03-17 19:25:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:36,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:36,974 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:25:36,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:36,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2075555736, now seen corresponding path program 1 times [2025-03-17 19:25:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-03-17 19:25:36,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:36,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:25:36,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:25:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:25:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:37,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-03-17 19:25:37,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:37,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976291745] [2025-03-17 19:25:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:37,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:37,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:37,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:37,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:37,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:37,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:37,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:37,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:37,170 INFO L124 PetriNetUnfolderBase]: 640/1326 cut-off events. [2025-03-17 19:25:37,171 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-17 19:25:37,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1326 events. 640/1326 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7260 event pairs, 264 based on Foata normal form. 36/1290 useless extension candidates. Maximal degree in co-relation 2461. Up to 882 conditions per place. [2025-03-17 19:25:37,176 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-03-17 19:25:37,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 279 flow [2025-03-17 19:25:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-17 19:25:37,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-17 19:25:37,177 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 150 flow. Second operand 3 states and 105 transitions. [2025-03-17 19:25:37,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 279 flow [2025-03-17 19:25:37,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:37,179 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 148 flow [2025-03-17 19:25:37,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-03-17 19:25:37,179 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-03-17 19:25:37,179 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 148 flow [2025-03-17 19:25:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:37,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:37,180 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:37,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:25:37,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:37,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1789850280, now seen corresponding path program 1 times [2025-03-17 19:25:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:37,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417325775] [2025-03-17 19:25:37,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:37,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:25:37,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:25:37,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:37,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:25:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417325775] [2025-03-17 19:25:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417325775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501267730] [2025-03-17 19:25:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:37,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:37,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:37,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:37,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:37,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:37,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:37,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:37,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:37,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:37,348 INFO L124 PetriNetUnfolderBase]: 695/1410 cut-off events. [2025-03-17 19:25:37,348 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-17 19:25:37,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1410 events. 695/1410 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7804 event pairs, 102 based on Foata normal form. 33/1396 useless extension candidates. Maximal degree in co-relation 2639. Up to 913 conditions per place. [2025-03-17 19:25:37,355 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-17 19:25:37,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 274 flow [2025-03-17 19:25:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-17 19:25:37,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-17 19:25:37,357 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 148 flow. Second operand 3 states and 105 transitions. [2025-03-17 19:25:37,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 274 flow [2025-03-17 19:25:37,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:37,358 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 146 flow [2025-03-17 19:25:37,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-03-17 19:25:37,359 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2025-03-17 19:25:37,359 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 146 flow [2025-03-17 19:25:37,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:37,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:37,359 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 19:25:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:25:37,359 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:37,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 349189806, now seen corresponding path program 1 times [2025-03-17 19:25:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-03-17 19:25:37,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:37,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:25:37,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:25:37,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:37,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-03-17 19:25:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625326289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998185862] [2025-03-17 19:25:37,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:37,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:37,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:37,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:37,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:25:37,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:25:37,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:25:37,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:37,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:37,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:25:37,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:37,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:25:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998185862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:25:37,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:25:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 19:25:37,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340098748] [2025-03-17 19:25:37,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:25:37,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:25:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:37,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:25:37,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:25:37,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-17 19:25:37,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 146 flow. Second operand has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:37,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:37,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-17 19:25:37,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:37,864 INFO L124 PetriNetUnfolderBase]: 640/1331 cut-off events. [2025-03-17 19:25:37,864 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-17 19:25:37,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 1331 events. 640/1331 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7453 event pairs, 570 based on Foata normal form. 3/1239 useless extension candidates. Maximal degree in co-relation 2451. Up to 1039 conditions per place. [2025-03-17 19:25:37,871 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2025-03-17 19:25:37,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 58 transitions, 264 flow [2025-03-17 19:25:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:25:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:25:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2025-03-17 19:25:37,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251748251748252 [2025-03-17 19:25:37,873 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 146 flow. Second operand 13 states and 304 transitions. [2025-03-17 19:25:37,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 58 transitions, 264 flow [2025-03-17 19:25:37,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 58 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:37,876 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 219 flow [2025-03-17 19:25:37,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=219, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-03-17 19:25:37,877 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-03-17 19:25:37,877 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 219 flow [2025-03-17 19:25:37,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:37,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:37,878 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 19:25:37,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:25:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:25:38,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-17 19:25:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1501271173, now seen corresponding path program 2 times [2025-03-17 19:25:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688502289] [2025-03-17 19:25:38,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:25:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:38,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 19:25:38,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:25:38,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:25:38,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:25:38,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:25:38,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:25:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:25:38,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:38,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:25:38,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:25:38,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-17 19:25:38,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-17 19:25:38,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:25:38,122 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:25:38,123 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:25:38,123 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 19:25:38,150 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:25:38,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 172 flow [2025-03-17 19:25:38,159 INFO L124 PetriNetUnfolderBase]: 7/85 cut-off events. [2025-03-17 19:25:38,160 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 19:25:38,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-03-17 19:25:38,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 77 transitions, 172 flow [2025-03-17 19:25:38,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 77 transitions, 172 flow [2025-03-17 19:25:38,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:25:38,162 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;@240a1ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:25:38,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 19:25:38,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:25:38,163 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:25:38,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:25:38,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:38,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:25:38,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:38,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 374498, now seen corresponding path program 1 times [2025-03-17 19:25:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161705667] [2025-03-17 19:25:38,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:38,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:25:38,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:25:38,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:38,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161705667] [2025-03-17 19:25:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161705667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:38,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:38,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551515095] [2025-03-17 19:25:38,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:38,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:25:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:38,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:25:38,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:25:38,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:38,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:38,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:38,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:38,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:39,319 INFO L124 PetriNetUnfolderBase]: 11409/19203 cut-off events. [2025-03-17 19:25:39,319 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-03-17 19:25:39,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35533 conditions, 19203 events. 11409/19203 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146662 event pairs, 10250 based on Foata normal form. 1159/19045 useless extension candidates. Maximal degree in co-relation 15025. Up to 15805 conditions per place. [2025-03-17 19:25:39,435 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 43 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-17 19:25:39,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 260 flow [2025-03-17 19:25:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:25:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:25:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2025-03-17 19:25:39,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487012987012987 [2025-03-17 19:25:39,437 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 172 flow. Second operand 4 states and 169 transitions. [2025-03-17 19:25:39,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 260 flow [2025-03-17 19:25:39,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 19:25:39,439 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 186 flow [2025-03-17 19:25:39,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-17 19:25:39,440 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-17 19:25:39,440 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 186 flow [2025-03-17 19:25:39,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:39,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:39,440 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:25:39,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:25:39,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:39,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1727907444, now seen corresponding path program 1 times [2025-03-17 19:25:39,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:39,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102722684] [2025-03-17 19:25:39,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:25:39,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:25:39,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:39,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102722684] [2025-03-17 19:25:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102722684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313344437] [2025-03-17 19:25:39,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:39,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:39,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:25:39,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:25:39,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:25:39,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:39,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:39,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:25:39,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:39,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:25:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313344437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:25:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:25:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299292113] [2025-03-17 19:25:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:25:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:39,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:25:39,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:25:39,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:39,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:39,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:39,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:39,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:40,621 INFO L124 PetriNetUnfolderBase]: 11409/19202 cut-off events. [2025-03-17 19:25:40,622 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-03-17 19:25:40,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35422 conditions, 19202 events. 11409/19202 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146634 event pairs, 10250 based on Foata normal form. 1/17886 useless extension candidates. Maximal degree in co-relation 35402. Up to 15800 conditions per place. [2025-03-17 19:25:40,719 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 39 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2025-03-17 19:25:40,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 272 flow [2025-03-17 19:25:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:25:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:25:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-03-17 19:25:40,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-17 19:25:40,721 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 186 flow. Second operand 6 states and 220 transitions. [2025-03-17 19:25:40,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 272 flow [2025-03-17 19:25:40,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:25:40,724 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 192 flow [2025-03-17 19:25:40,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-17 19:25:40,725 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-17 19:25:40,725 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 192 flow [2025-03-17 19:25:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:40,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:40,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:25:40,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:25:40,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:40,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2025522887, now seen corresponding path program 1 times [2025-03-17 19:25:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412423130] [2025-03-17 19:25:40,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:25:40,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:25:40,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:40,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:25:40,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412423130] [2025-03-17 19:25:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412423130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689756508] [2025-03-17 19:25:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:40,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:40,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:40,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:40,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:40,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:40,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:40,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:40,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:42,112 INFO L124 PetriNetUnfolderBase]: 11409/19201 cut-off events. [2025-03-17 19:25:42,112 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2025-03-17 19:25:42,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35424 conditions, 19201 events. 11409/19201 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146688 event pairs, 10250 based on Foata normal form. 1/17886 useless extension candidates. Maximal degree in co-relation 35398. Up to 15803 conditions per place. [2025-03-17 19:25:42,201 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 40 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-03-17 19:25:42,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 276 flow [2025-03-17 19:25:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-17 19:25:42,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2025-03-17 19:25:42,205 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 192 flow. Second operand 3 states and 130 transitions. [2025-03-17 19:25:42,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 276 flow [2025-03-17 19:25:42,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 254 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 19:25:42,207 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 174 flow [2025-03-17 19:25:42,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-03-17 19:25:42,207 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-17 19:25:42,207 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 174 flow [2025-03-17 19:25:42,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:42,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:42,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:42,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:25:42,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:42,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -906780940, now seen corresponding path program 1 times [2025-03-17 19:25:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005367838] [2025-03-17 19:25:42,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:42,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:25:42,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:25:42,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:42,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005367838] [2025-03-17 19:25:42,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005367838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711101529] [2025-03-17 19:25:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:42,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:42,244 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:42,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:25:42,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:25:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:25:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:42,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:25:42,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:42,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:25:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711101529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:25:42,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:25:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 19:25:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960646589] [2025-03-17 19:25:42,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:25:42,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:25:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:42,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:25:42,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:25:42,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:42,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:42,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:42,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:42,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:43,273 INFO L124 PetriNetUnfolderBase]: 11409/19205 cut-off events. [2025-03-17 19:25:43,273 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2025-03-17 19:25:43,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35427 conditions, 19205 events. 11409/19205 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146442 event pairs, 10250 based on Foata normal form. 2/17892 useless extension candidates. Maximal degree in co-relation 35391. Up to 15801 conditions per place. [2025-03-17 19:25:43,373 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2025-03-17 19:25:43,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 76 transitions, 283 flow [2025-03-17 19:25:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:25:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:25:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-03-17 19:25:43,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-03-17 19:25:43,374 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 174 flow. Second operand 7 states and 252 transitions. [2025-03-17 19:25:43,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 76 transitions, 283 flow [2025-03-17 19:25:43,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:43,376 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 200 flow [2025-03-17 19:25:43,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2025-03-17 19:25:43,376 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-17 19:25:43,376 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 200 flow [2025-03-17 19:25:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:43,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:43,377 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:43,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:25:43,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:43,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:43,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 128243380, now seen corresponding path program 2 times [2025-03-17 19:25:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597779829] [2025-03-17 19:25:43,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:25:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:43,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:25:43,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-17 19:25:43,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:25:43,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:25:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597779829] [2025-03-17 19:25:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597779829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417465964] [2025-03-17 19:25:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:43,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:43,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-17 19:25:43,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:43,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:44,579 INFO L124 PetriNetUnfolderBase]: 12446/20635 cut-off events. [2025-03-17 19:25:44,579 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2025-03-17 19:25:44,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38336 conditions, 20635 events. 12446/20635 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 158868 event pairs, 1538 based on Foata normal form. 399/20377 useless extension candidates. Maximal degree in co-relation 38295. Up to 14759 conditions per place. [2025-03-17 19:25:44,658 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 72 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-17 19:25:44,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 408 flow [2025-03-17 19:25:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-17 19:25:44,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2025-03-17 19:25:44,659 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 200 flow. Second operand 3 states and 157 transitions. [2025-03-17 19:25:44,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 408 flow [2025-03-17 19:25:44,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 101 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:44,661 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 198 flow [2025-03-17 19:25:44,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-03-17 19:25:44,662 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-17 19:25:44,662 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 198 flow [2025-03-17 19:25:44,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-17 19:25:44,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:44,662 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:44,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 19:25:44,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:44,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -319422157, now seen corresponding path program 1 times [2025-03-17 19:25:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106757692] [2025-03-17 19:25:44,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:44,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:25:44,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:25:44,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:44,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:25:44,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106757692] [2025-03-17 19:25:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106757692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:44,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595692407] [2025-03-17 19:25:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:44,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:44,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:44,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:44,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:44,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-17 19:25:44,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:44,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:44,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:45,871 INFO L124 PetriNetUnfolderBase]: 11409/19199 cut-off events. [2025-03-17 19:25:45,871 INFO L125 PetriNetUnfolderBase]: For 1221/1221 co-relation queries the response was YES. [2025-03-17 19:25:45,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36225 conditions, 19199 events. 11409/19199 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 148499 event pairs, 1538 based on Foata normal form. 399/18956 useless extension candidates. Maximal degree in co-relation 36185. Up to 13323 conditions per place. [2025-03-17 19:25:46,013 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 71 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-17 19:25:46,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 404 flow [2025-03-17 19:25:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-17 19:25:46,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-03-17 19:25:46,014 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 198 flow. Second operand 3 states and 156 transitions. [2025-03-17 19:25:46,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 404 flow [2025-03-17 19:25:46,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:46,018 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 196 flow [2025-03-17 19:25:46,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-03-17 19:25:46,018 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-17 19:25:46,018 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 196 flow [2025-03-17 19:25:46,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-17 19:25:46,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:46,019 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:46,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 19:25:46,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:46,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2067604200, now seen corresponding path program 1 times [2025-03-17 19:25:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:46,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-03-17 19:25:46,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:46,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:25:46,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:25:46,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:46,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:46,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:46,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-03-17 19:25:46,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136721804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:25:46,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739129655] [2025-03-17 19:25:46,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:46,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:46,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:25:46,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:25:46,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:25:46,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:25:46,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:25:46,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:46,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:46,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:25:46,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:25:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:46,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:25:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:46,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739129655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:25:46,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:25:46,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 19:25:46,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762759910] [2025-03-17 19:25:46,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:25:46,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:25:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:46,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:25:46,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:25:46,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:46,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 196 flow. Second operand has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:46,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:46,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:46,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:47,310 INFO L124 PetriNetUnfolderBase]: 11409/19208 cut-off events. [2025-03-17 19:25:47,310 INFO L125 PetriNetUnfolderBase]: For 1264/1264 co-relation queries the response was YES. [2025-03-17 19:25:47,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36252 conditions, 19208 events. 11409/19208 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146551 event pairs, 10250 based on Foata normal form. 3/17902 useless extension candidates. Maximal degree in co-relation 36185. Up to 15801 conditions per place. [2025-03-17 19:25:47,391 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-03-17 19:25:47,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 80 transitions, 338 flow [2025-03-17 19:25:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:25:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:25:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 433 transitions. [2025-03-17 19:25:47,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4325674325674326 [2025-03-17 19:25:47,392 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 196 flow. Second operand 13 states and 433 transitions. [2025-03-17 19:25:47,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 80 transitions, 338 flow [2025-03-17 19:25:47,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 80 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:47,394 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 269 flow [2025-03-17 19:25:47,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=269, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-03-17 19:25:47,395 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2025-03-17 19:25:47,395 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 269 flow [2025-03-17 19:25:47,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:47,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:47,395 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:47,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:25:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:25:47,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:47,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1990920430, now seen corresponding path program 2 times [2025-03-17 19:25:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:47,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 19:25:47,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:25:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:47,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:25:47,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 27 statements. [2025-03-17 19:25:47,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:25:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 19:25:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:47,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 19:25:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744186530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:47,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263896957] [2025-03-17 19:25:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:47,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:47,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:47,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:47,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:47,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-03-17 19:25:47,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:47,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:47,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:48,614 INFO L124 PetriNetUnfolderBase]: 12443/20454 cut-off events. [2025-03-17 19:25:48,615 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2025-03-17 19:25:48,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38186 conditions, 20454 events. 12443/20454 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 151622 event pairs, 3941 based on Foata normal form. 396/19986 useless extension candidates. Maximal degree in co-relation 38099. Up to 14696 conditions per place. [2025-03-17 19:25:48,684 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 77 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-03-17 19:25:48,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 480 flow [2025-03-17 19:25:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-17 19:25:48,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-03-17 19:25:48,685 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 269 flow. Second operand 3 states and 156 transitions. [2025-03-17 19:25:48,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 480 flow [2025-03-17 19:25:48,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 470 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 19:25:48,687 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 261 flow [2025-03-17 19:25:48,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-03-17 19:25:48,687 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 16 predicate places. [2025-03-17 19:25:48,687 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 261 flow [2025-03-17 19:25:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-03-17 19:25:48,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:48,687 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:48,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 19:25:48,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:48,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1588991566, now seen corresponding path program 1 times [2025-03-17 19:25:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185362279] [2025-03-17 19:25:48,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:25:48,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:25:48,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:48,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 19:25:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:48,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185362279] [2025-03-17 19:25:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185362279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:48,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:48,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493774850] [2025-03-17 19:25:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:48,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:48,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:48,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:48,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:48,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-03-17 19:25:48,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:48,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:48,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:49,571 INFO L124 PetriNetUnfolderBase]: 11409/18892 cut-off events. [2025-03-17 19:25:49,571 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2025-03-17 19:25:49,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35949 conditions, 18892 events. 11409/18892 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 138960 event pairs, 3644 based on Foata normal form. 396/18475 useless extension candidates. Maximal degree in co-relation 35866. Up to 13266 conditions per place. [2025-03-17 19:25:49,680 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-03-17 19:25:49,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 470 flow [2025-03-17 19:25:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-17 19:25:49,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-03-17 19:25:49,681 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 261 flow. Second operand 3 states and 155 transitions. [2025-03-17 19:25:49,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 470 flow [2025-03-17 19:25:49,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 103 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:49,684 INFO L231 Difference]: Finished difference. Result has 92 places, 78 transitions, 259 flow [2025-03-17 19:25:49,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=92, PETRI_TRANSITIONS=78} [2025-03-17 19:25:49,684 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-03-17 19:25:49,684 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 259 flow [2025-03-17 19:25:49,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-03-17 19:25:49,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:49,685 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 19:25:49,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2053091905, now seen corresponding path program 1 times [2025-03-17 19:25:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246384561] [2025-03-17 19:25:49,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:49,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:25:49,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:25:49,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:49,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 19:25:49,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:49,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246384561] [2025-03-17 19:25:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246384561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:49,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108782451] [2025-03-17 19:25:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:49,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:25:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:49,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:25:49,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:25:49,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-17 19:25:49,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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-03-17 19:25:49,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:49,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-17 19:25:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:25:50,666 INFO L124 PetriNetUnfolderBase]: 12377/20389 cut-off events. [2025-03-17 19:25:50,666 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2025-03-17 19:25:50,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38843 conditions, 20389 events. 12377/20389 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 152818 event pairs, 2132 based on Foata normal form. 363/20146 useless extension candidates. Maximal degree in co-relation 38760. Up to 13673 conditions per place. [2025-03-17 19:25:50,782 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-17 19:25:50,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 465 flow [2025-03-17 19:25:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:25:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:25:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-17 19:25:50,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-03-17 19:25:50,783 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 259 flow. Second operand 3 states and 155 transitions. [2025-03-17 19:25:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 465 flow [2025-03-17 19:25:50,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:25:50,786 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 257 flow [2025-03-17 19:25:50,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2025-03-17 19:25:50,786 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2025-03-17 19:25:50,786 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 257 flow [2025-03-17 19:25:50,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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-03-17 19:25:50,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:50,787 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 19:25:50,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-17 19:25:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 778634121, now seen corresponding path program 1 times [2025-03-17 19:25:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148160969] [2025-03-17 19:25:50,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:50,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:25:50,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:25:50,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:50,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:25:50,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:25:50,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:25:50,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:25:50,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:50,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:25:50,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:25:50,810 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-17 19:25:50,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-17 19:25:50,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-17 19:25:50,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 19:25:50,812 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:25:50,812 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:25:50,812 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 19:25:50,845 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:25:50,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 226 flow [2025-03-17 19:25:50,854 INFO L124 PetriNetUnfolderBase]: 9/110 cut-off events. [2025-03-17 19:25:50,855 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 19:25:50,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 110 events. 9/110 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 330 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-03-17 19:25:50,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 226 flow [2025-03-17 19:25:50,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 226 flow [2025-03-17 19:25:50,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:25:50,859 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;@240a1ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:25:50,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 19:25:50,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:25:50,860 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:25:50,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:25:50,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:25:50,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:25:50,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-17 19:25:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:25:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 472805, now seen corresponding path program 1 times [2025-03-17 19:25:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:25:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378471763] [2025-03-17 19:25:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:25:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:25:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:25:50,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:25:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:25:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:25:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:25:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:25:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378471763] [2025-03-17 19:25:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378471763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:25:50,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:25:50,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:25:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421247339] [2025-03-17 19:25:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:25:50,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:25:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:25:50,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:25:50,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:25:50,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-03-17 19:25:50,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:25:50,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:25:50,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-03-17 19:25:50,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:04,409 INFO L124 PetriNetUnfolderBase]: 173791/260043 cut-off events. [2025-03-17 19:26:04,409 INFO L125 PetriNetUnfolderBase]: For 14935/14935 co-relation queries the response was YES. [2025-03-17 19:26:04,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489334 conditions, 260043 events. 173791/260043 cut-off events. For 14935/14935 co-relation queries the response was YES. Maximal size of possible extension queue 8058. Compared 2290130 event pairs, 156660 based on Foata normal form. 17131/262292 useless extension candidates. Maximal degree in co-relation 75190. Up to 222110 conditions per place. [2025-03-17 19:26:05,828 INFO L140 encePairwiseOnDemand]: 88/99 looper letters, 55 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-17 19:26:05,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 336 flow [2025-03-17 19:26:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:26:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:26:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2025-03-17 19:26:05,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505050505050505 [2025-03-17 19:26:05,830 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 226 flow. Second operand 4 states and 218 transitions. [2025-03-17 19:26:05,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 336 flow [2025-03-17 19:26:05,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 330 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 19:26:05,838 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 234 flow [2025-03-17 19:26:05,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2025-03-17 19:26:05,838 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 4 predicate places. [2025-03-17 19:26:05,838 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 234 flow [2025-03-17 19:26:05,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:26:05,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:05,839 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:26:05,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 19:26:05,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-17 19:26:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1200854700, now seen corresponding path program 1 times [2025-03-17 19:26:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-03-17 19:26:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:05,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:05,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:05,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:05,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:26:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-03-17 19:26:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625505099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:26:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731409102] [2025-03-17 19:26:05,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:05,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:26:05,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:26:05,875 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:26:05,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:26:05,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:05,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:05,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:05,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:05,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:26:05,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:26:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:26:05,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:26:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731409102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:05,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:26:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:26:05,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373357708] [2025-03-17 19:26:05,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:05,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:26:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:05,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:26:05,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:26:05,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-03-17 19:26:05,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:26:05,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:05,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-03-17 19:26:05,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand