./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longer.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/queue_longer.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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:23:58,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:23:58,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:23:58,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:23:58,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:23:58,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:23:58,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:23:58,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:23:58,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:23:58,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:23:58,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:23:58,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:23:58,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:23:58,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:23:58,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:23:58,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:23:58,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:23:58,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:23:58,709 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-03-17 19:23:58,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:23:58,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:23:58,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:23:58,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:23:58,975 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:23:58,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-03-17 19:24:00,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f04024f4/27b533afc5ef478ebd2c3f61c7ea249b/FLAGd76dfc64e [2025-03-17 19:24:00,480 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:24:00,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-03-17 19:24:00,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f04024f4/27b533afc5ef478ebd2c3f61c7ea249b/FLAGd76dfc64e [2025-03-17 19:24:00,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f04024f4/27b533afc5ef478ebd2c3f61c7ea249b [2025-03-17 19:24:00,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:24:00,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:24:00,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:24:00,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:24:00,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:24:00,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:24:00" (1/1) ... [2025-03-17 19:24:00,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c245dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:00, skipping insertion in model container [2025-03-17 19:24:00,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:24:00" (1/1) ... [2025-03-17 19:24:00,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:24:01,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:24:01,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:24:01,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:24:01,301 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:24:01,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01 WrapperNode [2025-03-17 19:24:01,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:24:01,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:24:01,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:24:01,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:24:01,306 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:24:01" (1/1) ... [2025-03-17 19:24:01,325 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:24:01" (1/1) ... [2025-03-17 19:24:01,377 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1058 [2025-03-17 19:24:01,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:24:01,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:24:01,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:24:01,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:24:01,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,427 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 434, 403]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 403, 400]. The 16 writes are split as follows [0, 0, 14, 2]. [2025-03-17 19:24:01,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:24:01,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:24:01,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:24:01,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:24:01,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (1/1) ... [2025-03-17 19:24:01,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:24:01,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:24:01,508 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:24:01,510 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:24:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 19:24:01,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 19:24:01,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 19:24:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:24:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 19:24:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:24:01,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:24:01,530 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:24:01,652 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:24:01,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:24:02,686 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:24:02,686 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:24:08,061 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:24:08,062 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:24:08,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:24:08 BoogieIcfgContainer [2025-03-17 19:24:08,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:24:08,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:24:08,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:24:08,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:24:08,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:24:00" (1/3) ... [2025-03-17 19:24:08,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9cf94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:24:08, skipping insertion in model container [2025-03-17 19:24:08,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:24:01" (2/3) ... [2025-03-17 19:24:08,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9cf94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:24:08, skipping insertion in model container [2025-03-17 19:24:08,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:24:08" (3/3) ... [2025-03-17 19:24:08,072 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-03-17 19:24:08,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:24:08,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-17 19:24:08,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:24:08,162 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:24:08,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 180 flow [2025-03-17 19:24:08,241 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2025-03-17 19:24:08,243 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:24:08,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 9/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 204 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-17 19:24:08,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 83 transitions, 180 flow [2025-03-17 19:24:08,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 167 flow [2025-03-17 19:24:08,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:24:08,264 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;@b57b53c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:24:08,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 19:24:08,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:24:08,293 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-17 19:24:08,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:24:08,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:08,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:24:08,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:08,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1977721339, now seen corresponding path program 1 times [2025-03-17 19:24:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639306575] [2025-03-17 19:24:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:24:08,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:24:08,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:08,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:09,667 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:24:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639306575] [2025-03-17 19:24:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639306575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:24:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760673679] [2025-03-17 19:24:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:09,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:24:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:09,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:24:09,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:24:09,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:09,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:24:09,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:09,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:10,399 INFO L124 PetriNetUnfolderBase]: 1233/2525 cut-off events. [2025-03-17 19:24:10,401 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-17 19:24:10,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 2525 events. 1233/2525 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 15697 event pairs, 205 based on Foata normal form. 48/2196 useless extension candidates. Maximal degree in co-relation 4434. Up to 1608 conditions per place. [2025-03-17 19:24:10,428 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 73 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-17 19:24:10,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 391 flow [2025-03-17 19:24:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:24:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:24:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-03-17 19:24:10,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6295180722891566 [2025-03-17 19:24:10,442 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 4 states and 209 transitions. [2025-03-17 19:24:10,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 391 flow [2025-03-17 19:24:10,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:24:10,449 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 202 flow [2025-03-17 19:24:10,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-03-17 19:24:10,453 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-17 19:24:10,454 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 202 flow [2025-03-17 19:24:10,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:24:10,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:10,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:10,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:24:10,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:10,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1179817147, now seen corresponding path program 1 times [2025-03-17 19:24:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:10,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233986192] [2025-03-17 19:24:10,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:10,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:24:10,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:24:10,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:10,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:11,136 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:24:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233986192] [2025-03-17 19:24:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233986192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:24:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359480715] [2025-03-17 19:24:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:11,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:24:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:11,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:24:11,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:24:11,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:11,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:24:11,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:11,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:11,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:11,670 INFO L124 PetriNetUnfolderBase]: 1242/2581 cut-off events. [2025-03-17 19:24:11,671 INFO L125 PetriNetUnfolderBase]: For 452/455 co-relation queries the response was YES. [2025-03-17 19:24:11,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 2581 events. 1242/2581 cut-off events. For 452/455 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 16503 event pairs, 264 based on Foata normal form. 38/2287 useless extension candidates. Maximal degree in co-relation 4354. Up to 1757 conditions per place. [2025-03-17 19:24:11,685 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2025-03-17 19:24:11,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 456 flow [2025-03-17 19:24:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:24:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:24:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-03-17 19:24:11,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 19:24:11,687 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 202 flow. Second operand 5 states and 249 transitions. [2025-03-17 19:24:11,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 456 flow [2025-03-17 19:24:11,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:24:11,690 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 219 flow [2025-03-17 19:24:11,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-03-17 19:24:11,691 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-17 19:24:11,691 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 219 flow [2025-03-17 19:24:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:24:11,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:11,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:24:11,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:11,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 67160873, now seen corresponding path program 1 times [2025-03-17 19:24:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958214580] [2025-03-17 19:24:11,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:11,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:11,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:24:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:24:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:12,473 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:24:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:12,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958214580] [2025-03-17 19:24:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958214580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270158727] [2025-03-17 19:24:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:24:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:12,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:24:12,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:24:12,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:12,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:12,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:12,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:13,108 INFO L124 PetriNetUnfolderBase]: 1322/2691 cut-off events. [2025-03-17 19:24:13,109 INFO L125 PetriNetUnfolderBase]: For 528/544 co-relation queries the response was YES. [2025-03-17 19:24:13,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5199 conditions, 2691 events. 1322/2691 cut-off events. For 528/544 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 17135 event pairs, 266 based on Foata normal form. 40/2367 useless extension candidates. Maximal degree in co-relation 4657. Up to 1803 conditions per place. [2025-03-17 19:24:13,126 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 102 selfloop transitions, 11 changer transitions 0/143 dead transitions. [2025-03-17 19:24:13,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 143 transitions, 585 flow [2025-03-17 19:24:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:24:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:24:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2025-03-17 19:24:13,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851979345955249 [2025-03-17 19:24:13,131 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 219 flow. Second operand 7 states and 340 transitions. [2025-03-17 19:24:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 143 transitions, 585 flow [2025-03-17 19:24:13,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 571 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 19:24:13,138 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 274 flow [2025-03-17 19:24:13,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-03-17 19:24:13,139 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-17 19:24:13,139 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 274 flow [2025-03-17 19:24:13,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:13,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:13,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:13,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:24:13,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:13,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1015268374, now seen corresponding path program 1 times [2025-03-17 19:24:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664868438] [2025-03-17 19:24:13,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:13,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:24:13,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:24:13,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:13,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:13,374 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:24:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664868438] [2025-03-17 19:24:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664868438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:13,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:13,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:24:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299455304] [2025-03-17 19:24:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:24:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:13,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:24:13,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:24:13,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-17 19:24:13,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:13,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:13,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-17 19:24:13,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:13,831 INFO L124 PetriNetUnfolderBase]: 1023/2371 cut-off events. [2025-03-17 19:24:13,831 INFO L125 PetriNetUnfolderBase]: For 522/522 co-relation queries the response was YES. [2025-03-17 19:24:13,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4342 conditions, 2371 events. 1023/2371 cut-off events. For 522/522 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13906 event pairs, 483 based on Foata normal form. 41/2110 useless extension candidates. Maximal degree in co-relation 4332. Up to 884 conditions per place. [2025-03-17 19:24:13,845 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 63 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-17 19:24:13,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 370 flow [2025-03-17 19:24:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:24:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:24:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-17 19:24:13,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2025-03-17 19:24:13,847 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 274 flow. Second operand 3 states and 175 transitions. [2025-03-17 19:24:13,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 370 flow [2025-03-17 19:24:13,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 331 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-03-17 19:24:13,850 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 167 flow [2025-03-17 19:24:13,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2025-03-17 19:24:13,851 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-17 19:24:13,851 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 167 flow [2025-03-17 19:24:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:13,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:13,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:24:13,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -715289235, now seen corresponding path program 1 times [2025-03-17 19:24:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434672087] [2025-03-17 19:24:13,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:13,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:24:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:24:13,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:13,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:13,999 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:24:13,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:13,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434672087] [2025-03-17 19:24:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434672087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:13,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306307899] [2025-03-17 19:24:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:14,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:24:14,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:14,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:24:14,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:24:14,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-17 19:24:14,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:14,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:14,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-17 19:24:14,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:14,704 INFO L124 PetriNetUnfolderBase]: 1890/4150 cut-off events. [2025-03-17 19:24:14,704 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-17 19:24:14,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7403 conditions, 4150 events. 1890/4150 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 26986 event pairs, 949 based on Foata normal form. 138/3770 useless extension candidates. Maximal degree in co-relation 7398. Up to 1977 conditions per place. [2025-03-17 19:24:14,730 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 112 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-17 19:24:14,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 143 transitions, 550 flow [2025-03-17 19:24:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:24:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:24:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-03-17 19:24:14,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7560240963855421 [2025-03-17 19:24:14,733 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 167 flow. Second operand 4 states and 251 transitions. [2025-03-17 19:24:14,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 143 transitions, 550 flow [2025-03-17 19:24:14,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:24:14,737 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 188 flow [2025-03-17 19:24:14,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-03-17 19:24:14,738 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-03-17 19:24:14,738 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 188 flow [2025-03-17 19:24:14,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:14,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:14,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:24:14,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 121166769, now seen corresponding path program 1 times [2025-03-17 19:24:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116252320] [2025-03-17 19:24:14,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:14,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:24:14,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:24:14,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:15,654 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:24:15,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:15,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116252320] [2025-03-17 19:24:15,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116252320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:15,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:24:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185723757] [2025-03-17 19:24:15,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:15,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:24:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:15,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:24:15,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:24:15,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-17 19:24:15,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:24:15,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:15,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-17 19:24:15,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:16,294 INFO L124 PetriNetUnfolderBase]: 1715/3851 cut-off events. [2025-03-17 19:24:16,294 INFO L125 PetriNetUnfolderBase]: For 792/912 co-relation queries the response was YES. [2025-03-17 19:24:16,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7354 conditions, 3851 events. 1715/3851 cut-off events. For 792/912 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 25043 event pairs, 279 based on Foata normal form. 0/3402 useless extension candidates. Maximal degree in co-relation 7347. Up to 2409 conditions per place. [2025-03-17 19:24:16,316 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 74 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-03-17 19:24:16,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 464 flow [2025-03-17 19:24:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:24:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:24:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-17 19:24:16,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2025-03-17 19:24:16,318 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 188 flow. Second operand 5 states and 251 transitions. [2025-03-17 19:24:16,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 464 flow [2025-03-17 19:24:16,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:24:16,321 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 194 flow [2025-03-17 19:24:16,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2025-03-17 19:24:16,322 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-17 19:24:16,322 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 194 flow [2025-03-17 19:24:16,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:24:16,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:16,323 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:16,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:24:16,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:16,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash -3041246, now seen corresponding path program 1 times [2025-03-17 19:24:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938604904] [2025-03-17 19:24:16,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:16,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:24:16,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:24:16,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:24:16,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938604904] [2025-03-17 19:24:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938604904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:24:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077226603] [2025-03-17 19:24:16,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:16,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:24:16,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:24:16,475 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:24:16,534 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:24:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:24:16,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:24:16,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:16,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:16,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:24:16,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:24:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:24:16,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:24:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077226603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:24:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 19:24:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873006301] [2025-03-17 19:24:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:16,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:24:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:16,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:24:16,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:24:16,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-17 19:24:16,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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:24:16,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:16,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-17 19:24:16,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:17,852 INFO L124 PetriNetUnfolderBase]: 1685/3664 cut-off events. [2025-03-17 19:24:17,852 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-03-17 19:24:17,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7248 conditions, 3664 events. 1685/3664 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 23192 event pairs, 96 based on Foata normal form. 70/3382 useless extension candidates. Maximal degree in co-relation 7241. Up to 1080 conditions per place. [2025-03-17 19:24:17,867 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 162 selfloop transitions, 5 changer transitions 0/195 dead transitions. [2025-03-17 19:24:17,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 820 flow [2025-03-17 19:24:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:24:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:24:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 367 transitions. [2025-03-17 19:24:17,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7369477911646586 [2025-03-17 19:24:17,868 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 194 flow. Second operand 6 states and 367 transitions. [2025-03-17 19:24:17,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 820 flow [2025-03-17 19:24:17,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 195 transitions, 778 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:24:17,872 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 190 flow [2025-03-17 19:24:17,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-17 19:24:17,873 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-17 19:24:17,873 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 190 flow [2025-03-17 19:24:17,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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:24:17,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:17,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:17,882 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:24:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:24:18,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1162897324, now seen corresponding path program 1 times [2025-03-17 19:24:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645918056] [2025-03-17 19:24:18,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:18,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:24:18,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:24:18,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:18,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:19,464 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:24:19,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645918056] [2025-03-17 19:24:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645918056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:19,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:19,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:24:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090936646] [2025-03-17 19:24:19,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:19,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:24:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:19,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:24:19,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:24:19,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-17 19:24:19,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:24:19,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:19,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-17 19:24:19,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:20,553 INFO L124 PetriNetUnfolderBase]: 2309/4784 cut-off events. [2025-03-17 19:24:20,553 INFO L125 PetriNetUnfolderBase]: For 1881/1957 co-relation queries the response was YES. [2025-03-17 19:24:20,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9934 conditions, 4784 events. 2309/4784 cut-off events. For 1881/1957 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 31071 event pairs, 444 based on Foata normal form. 22/4274 useless extension candidates. Maximal degree in co-relation 9927. Up to 2448 conditions per place. [2025-03-17 19:24:20,571 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 134 selfloop transitions, 8 changer transitions 0/167 dead transitions. [2025-03-17 19:24:20,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 167 transitions, 845 flow [2025-03-17 19:24:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:24:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 19:24:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-03-17 19:24:20,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-03-17 19:24:20,573 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 190 flow. Second operand 9 states and 378 transitions. [2025-03-17 19:24:20,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 167 transitions, 845 flow [2025-03-17 19:24:20,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 167 transitions, 805 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:24:20,576 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 222 flow [2025-03-17 19:24:20,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2025-03-17 19:24:20,577 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 12 predicate places. [2025-03-17 19:24:20,577 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 222 flow [2025-03-17 19:24:20,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:24:20,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:20,577 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:20,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:24:20,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:20,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -94276347, now seen corresponding path program 1 times [2025-03-17 19:24:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502058454] [2025-03-17 19:24:20,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:20,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:24:20,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:24:20,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:20,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:24:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502058454] [2025-03-17 19:24:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502058454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028142282] [2025-03-17 19:24:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:20,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:24:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:20,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:24:20,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:24:20,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-03-17 19:24:20,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:24:20,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:20,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-03-17 19:24:20,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:21,152 INFO L124 PetriNetUnfolderBase]: 1994/4213 cut-off events. [2025-03-17 19:24:21,152 INFO L125 PetriNetUnfolderBase]: For 1306/1360 co-relation queries the response was YES. [2025-03-17 19:24:21,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8828 conditions, 4213 events. 1994/4213 cut-off events. For 1306/1360 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 27140 event pairs, 368 based on Foata normal form. 83/3984 useless extension candidates. Maximal degree in co-relation 8819. Up to 1995 conditions per place. [2025-03-17 19:24:21,168 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 98 selfloop transitions, 6 changer transitions 6/138 dead transitions. [2025-03-17 19:24:21,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 612 flow [2025-03-17 19:24:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:24:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:24:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-17 19:24:21,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-03-17 19:24:21,170 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 222 flow. Second operand 4 states and 232 transitions. [2025-03-17 19:24:21,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 612 flow [2025-03-17 19:24:21,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 138 transitions, 586 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-17 19:24:21,175 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 222 flow [2025-03-17 19:24:21,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2025-03-17 19:24:21,176 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 10 predicate places. [2025-03-17 19:24:21,176 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 222 flow [2025-03-17 19:24:21,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:24:21,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:21,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:21,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:24:21,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:21,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1690076431, now seen corresponding path program 1 times [2025-03-17 19:24:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713732714] [2025-03-17 19:24:21,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:21,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:24:21,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:24:21,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:21,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:22,542 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:24:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713732714] [2025-03-17 19:24:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713732714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:24:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567899832] [2025-03-17 19:24:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:24:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:22,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:24:22,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:24:22,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-17 19:24:22,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:24:22,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:22,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-17 19:24:22,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:23,529 INFO L124 PetriNetUnfolderBase]: 2223/4643 cut-off events. [2025-03-17 19:24:23,530 INFO L125 PetriNetUnfolderBase]: For 2777/2777 co-relation queries the response was YES. [2025-03-17 19:24:23,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10228 conditions, 4643 events. 2223/4643 cut-off events. For 2777/2777 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 30242 event pairs, 444 based on Foata normal form. 22/4255 useless extension candidates. Maximal degree in co-relation 10219. Up to 2448 conditions per place. [2025-03-17 19:24:23,547 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 129 selfloop transitions, 8 changer transitions 2/164 dead transitions. [2025-03-17 19:24:23,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 164 transitions, 889 flow [2025-03-17 19:24:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:24:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 19:24:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 375 transitions. [2025-03-17 19:24:23,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5020080321285141 [2025-03-17 19:24:23,549 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 222 flow. Second operand 9 states and 375 transitions. [2025-03-17 19:24:23,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 164 transitions, 889 flow [2025-03-17 19:24:23,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 829 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:24:23,556 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 223 flow [2025-03-17 19:24:23,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-03-17 19:24:23,556 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2025-03-17 19:24:23,557 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 223 flow [2025-03-17 19:24:23,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:24:23,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:23,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:23,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:24:23,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:23,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash -852790313, now seen corresponding path program 1 times [2025-03-17 19:24:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:23,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543110113] [2025-03-17 19:24:23,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:23,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:24:23,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:24:23,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:23,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:23,661 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:24:23,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543110113] [2025-03-17 19:24:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543110113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788208724] [2025-03-17 19:24:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:23,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:24:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:23,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:24:23,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:24:23,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:23,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:23,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:23,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:23,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:24,292 INFO L124 PetriNetUnfolderBase]: 2829/5809 cut-off events. [2025-03-17 19:24:24,292 INFO L125 PetriNetUnfolderBase]: For 2551/2561 co-relation queries the response was YES. [2025-03-17 19:24:24,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12698 conditions, 5809 events. 2829/5809 cut-off events. For 2551/2561 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 39888 event pairs, 1541 based on Foata normal form. 144/5567 useless extension candidates. Maximal degree in co-relation 12688. Up to 3623 conditions per place. [2025-03-17 19:24:24,317 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 92 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2025-03-17 19:24:24,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 570 flow [2025-03-17 19:24:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:24:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:24:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-03-17 19:24:24,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6596385542168675 [2025-03-17 19:24:24,318 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 223 flow. Second operand 4 states and 219 transitions. [2025-03-17 19:24:24,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 570 flow [2025-03-17 19:24:24,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 120 transitions, 555 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 19:24:24,323 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 239 flow [2025-03-17 19:24:24,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2025-03-17 19:24:24,324 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-17 19:24:24,324 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 239 flow [2025-03-17 19:24:24,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:24,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:24,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:24,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:24:24,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:24,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash -665738377, now seen corresponding path program 1 times [2025-03-17 19:24:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:24,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45857494] [2025-03-17 19:24:24,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:24:24,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:24:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:25,154 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:24:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45857494] [2025-03-17 19:24:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45857494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:24:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680325381] [2025-03-17 19:24:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:25,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:24:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:25,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:24:25,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:24:25,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-03-17 19:24:25,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 239 flow. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 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:24:25,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:25,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-03-17 19:24:25,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:26,036 INFO L124 PetriNetUnfolderBase]: 3059/6185 cut-off events. [2025-03-17 19:24:26,036 INFO L125 PetriNetUnfolderBase]: For 2730/2796 co-relation queries the response was YES. [2025-03-17 19:24:26,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14268 conditions, 6185 events. 3059/6185 cut-off events. For 2730/2796 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 42323 event pairs, 484 based on Foata normal form. 0/5751 useless extension candidates. Maximal degree in co-relation 14255. Up to 2649 conditions per place. [2025-03-17 19:24:26,062 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 149 selfloop transitions, 15 changer transitions 2/191 dead transitions. [2025-03-17 19:24:26,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 191 transitions, 1005 flow [2025-03-17 19:24:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:24:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:24:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 444 transitions. [2025-03-17 19:24:26,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349397590361445 [2025-03-17 19:24:26,064 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 239 flow. Second operand 10 states and 444 transitions. [2025-03-17 19:24:26,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 191 transitions, 1005 flow [2025-03-17 19:24:26,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 191 transitions, 1002 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:24:26,070 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 311 flow [2025-03-17 19:24:26,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=311, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2025-03-17 19:24:26,071 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 24 predicate places. [2025-03-17 19:24:26,071 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 311 flow [2025-03-17 19:24:26,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 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:24:26,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:26,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:24:26,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:26,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 836949049, now seen corresponding path program 1 times [2025-03-17 19:24:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264808052] [2025-03-17 19:24:26,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:26,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:24:26,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:24:26,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:26,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:26,986 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:24:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264808052] [2025-03-17 19:24:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264808052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:24:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923558511] [2025-03-17 19:24:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:24:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:26,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:24:26,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:24:27,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:27,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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:24:27,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:27,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:27,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:27,825 INFO L124 PetriNetUnfolderBase]: 2804/5884 cut-off events. [2025-03-17 19:24:27,825 INFO L125 PetriNetUnfolderBase]: For 3277/3343 co-relation queries the response was YES. [2025-03-17 19:24:27,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14572 conditions, 5884 events. 2804/5884 cut-off events. For 3277/3343 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 41023 event pairs, 484 based on Foata normal form. 44/5766 useless extension candidates. Maximal degree in co-relation 14557. Up to 2649 conditions per place. [2025-03-17 19:24:27,848 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 146 selfloop transitions, 14 changer transitions 2/190 dead transitions. [2025-03-17 19:24:27,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 190 transitions, 1056 flow [2025-03-17 19:24:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:24:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:24:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 460 transitions. [2025-03-17 19:24:27,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5542168674698795 [2025-03-17 19:24:27,850 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 311 flow. Second operand 10 states and 460 transitions. [2025-03-17 19:24:27,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 190 transitions, 1056 flow [2025-03-17 19:24:27,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 190 transitions, 1044 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 19:24:27,858 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 331 flow [2025-03-17 19:24:27,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=331, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-17 19:24:27,858 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2025-03-17 19:24:27,858 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 331 flow [2025-03-17 19:24:27,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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:24:27,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:27,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:27,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:24:27,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:27,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1669375628, now seen corresponding path program 1 times [2025-03-17 19:24:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52097144] [2025-03-17 19:24:27,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:27,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:24:27,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:24:27,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:27,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:24:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52097144] [2025-03-17 19:24:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52097144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:24:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107222265] [2025-03-17 19:24:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:27,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:24:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:24:27,983 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:24:27,984 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:24:28,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:24:28,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:24:28,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:28,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:28,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:24:28,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:24:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:24:28,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:24:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107222265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:28,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:24:28,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-17 19:24:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513700935] [2025-03-17 19:24:28,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:28,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:24:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:28,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:24:28,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:24:28,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-17 19:24:28,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:24:28,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:28,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-17 19:24:28,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:28,887 INFO L124 PetriNetUnfolderBase]: 3091/6067 cut-off events. [2025-03-17 19:24:28,887 INFO L125 PetriNetUnfolderBase]: For 3779/3813 co-relation queries the response was YES. [2025-03-17 19:24:28,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15752 conditions, 6067 events. 3091/6067 cut-off events. For 3779/3813 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40312 event pairs, 692 based on Foata normal form. 150/5971 useless extension candidates. Maximal degree in co-relation 15735. Up to 3347 conditions per place. [2025-03-17 19:24:28,919 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 80 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-17 19:24:28,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 603 flow [2025-03-17 19:24:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:24:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:24:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-03-17 19:24:28,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843373493975904 [2025-03-17 19:24:28,920 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 331 flow. Second operand 4 states and 194 transitions. [2025-03-17 19:24:28,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 603 flow [2025-03-17 19:24:28,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 110 transitions, 579 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-17 19:24:28,930 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 309 flow [2025-03-17 19:24:28,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2025-03-17 19:24:28,931 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 22 predicate places. [2025-03-17 19:24:28,931 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 309 flow [2025-03-17 19:24:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:24:28,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:28,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:28,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:24:29,131 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,SelfDestructingSolverStorable13 [2025-03-17 19:24:29,132 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 211039167, now seen corresponding path program 1 times [2025-03-17 19:24:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405997401] [2025-03-17 19:24:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:29,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:24:29,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:24:29,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:29,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:24:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405997401] [2025-03-17 19:24:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405997401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124708607] [2025-03-17 19:24:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:24:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:29,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:24:29,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:24:29,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-17 19:24:29,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:24:29,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:29,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-17 19:24:29,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:29,779 INFO L124 PetriNetUnfolderBase]: 2735/5601 cut-off events. [2025-03-17 19:24:29,779 INFO L125 PetriNetUnfolderBase]: For 3802/3822 co-relation queries the response was YES. [2025-03-17 19:24:29,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14337 conditions, 5601 events. 2735/5601 cut-off events. For 3802/3822 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 37707 event pairs, 736 based on Foata normal form. 150/5611 useless extension candidates. Maximal degree in co-relation 14320. Up to 2824 conditions per place. [2025-03-17 19:24:29,805 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 84 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2025-03-17 19:24:29,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 613 flow [2025-03-17 19:24:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:24:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:24:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-17 19:24:29,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5993975903614458 [2025-03-17 19:24:29,806 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 309 flow. Second operand 4 states and 199 transitions. [2025-03-17 19:24:29,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 613 flow [2025-03-17 19:24:29,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 603 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:24:29,814 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 311 flow [2025-03-17 19:24:29,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2025-03-17 19:24:29,814 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2025-03-17 19:24:29,814 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 311 flow [2025-03-17 19:24:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:24:29,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:29,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:29,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:24:29,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:29,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1570944836, now seen corresponding path program 1 times [2025-03-17 19:24:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854347347] [2025-03-17 19:24:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:29,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:24:29,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:24:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:29,968 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:24:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854347347] [2025-03-17 19:24:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854347347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655236104] [2025-03-17 19:24:29,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:29,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:24:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:29,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:24:29,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:24:29,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-17 19:24:29,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:24:29,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:29,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-17 19:24:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:30,400 INFO L124 PetriNetUnfolderBase]: 1726/3931 cut-off events. [2025-03-17 19:24:30,400 INFO L125 PetriNetUnfolderBase]: For 3666/3666 co-relation queries the response was YES. [2025-03-17 19:24:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10383 conditions, 3931 events. 1726/3931 cut-off events. For 3666/3666 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25713 event pairs, 514 based on Foata normal form. 166/4019 useless extension candidates. Maximal degree in co-relation 10366. Up to 1934 conditions per place. [2025-03-17 19:24:30,410 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 63 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-03-17 19:24:30,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 520 flow [2025-03-17 19:24:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:24:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:24:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-17 19:24:30,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-03-17 19:24:30,411 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 311 flow. Second operand 3 states and 165 transitions. [2025-03-17 19:24:30,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 520 flow [2025-03-17 19:24:30,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 501 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 19:24:30,415 INFO L231 Difference]: Finished difference. Result has 98 places, 79 transitions, 297 flow [2025-03-17 19:24:30,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=98, PETRI_TRANSITIONS=79} [2025-03-17 19:24:30,415 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2025-03-17 19:24:30,415 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 79 transitions, 297 flow [2025-03-17 19:24:30,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:24:30,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:30,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:30,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:24:30,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:30,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 337809580, now seen corresponding path program 1 times [2025-03-17 19:24:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753799176] [2025-03-17 19:24:30,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:30,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:24:30,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:24:30,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:30,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:32,232 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:24:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753799176] [2025-03-17 19:24:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753799176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:32,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:24:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332351983] [2025-03-17 19:24:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:24:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:32,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:24:32,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:24:32,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-03-17 19:24:32,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 79 transitions, 297 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:32,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:32,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-03-17 19:24:32,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:34,026 INFO L124 PetriNetUnfolderBase]: 2620/5484 cut-off events. [2025-03-17 19:24:34,026 INFO L125 PetriNetUnfolderBase]: For 4603/4603 co-relation queries the response was YES. [2025-03-17 19:24:34,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15060 conditions, 5484 events. 2620/5484 cut-off events. For 4603/4603 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 36770 event pairs, 225 based on Foata normal form. 26/5374 useless extension candidates. Maximal degree in co-relation 15042. Up to 2016 conditions per place. [2025-03-17 19:24:34,052 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 177 selfloop transitions, 20 changer transitions 2/220 dead transitions. [2025-03-17 19:24:34,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 220 transitions, 1330 flow [2025-03-17 19:24:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:24:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 19:24:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 526 transitions. [2025-03-17 19:24:34,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45266781411359724 [2025-03-17 19:24:34,058 INFO L175 Difference]: Start difference. First operand has 98 places, 79 transitions, 297 flow. Second operand 14 states and 526 transitions. [2025-03-17 19:24:34,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 220 transitions, 1330 flow [2025-03-17 19:24:34,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 220 transitions, 1314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:24:34,067 INFO L231 Difference]: Finished difference. Result has 116 places, 88 transitions, 415 flow [2025-03-17 19:24:34,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=415, PETRI_PLACES=116, PETRI_TRANSITIONS=88} [2025-03-17 19:24:34,072 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 39 predicate places. [2025-03-17 19:24:34,072 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 88 transitions, 415 flow [2025-03-17 19:24:34,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:34,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:34,073 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:24:34,073 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash 173639996, now seen corresponding path program 1 times [2025-03-17 19:24:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258871304] [2025-03-17 19:24:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:34,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:24:34,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:24:34,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:34,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:24:34,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258871304] [2025-03-17 19:24:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258871304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:34,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:34,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:24:34,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712492352] [2025-03-17 19:24:34,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:34,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:24:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:34,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:24:34,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:24:34,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-17 19:24:34,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 88 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:24:34,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:34,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-17 19:24:34,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:34,756 INFO L124 PetriNetUnfolderBase]: 1955/4385 cut-off events. [2025-03-17 19:24:34,756 INFO L125 PetriNetUnfolderBase]: For 4664/4668 co-relation queries the response was YES. [2025-03-17 19:24:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 4385 events. 1955/4385 cut-off events. For 4664/4668 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 29649 event pairs, 1085 based on Foata normal form. 36/4327 useless extension candidates. Maximal degree in co-relation 12123. Up to 1970 conditions per place. [2025-03-17 19:24:34,774 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 71 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-17 19:24:34,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 595 flow [2025-03-17 19:24:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:24:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:24:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-17 19:24:34,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-03-17 19:24:34,775 INFO L175 Difference]: Start difference. First operand has 116 places, 88 transitions, 415 flow. Second operand 3 states and 165 transitions. [2025-03-17 19:24:34,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 595 flow [2025-03-17 19:24:34,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 561 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-03-17 19:24:34,787 INFO L231 Difference]: Finished difference. Result has 109 places, 82 transitions, 341 flow [2025-03-17 19:24:34,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2025-03-17 19:24:34,787 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 32 predicate places. [2025-03-17 19:24:34,787 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 82 transitions, 341 flow [2025-03-17 19:24:34,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:24:34,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:34,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:34,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:24:34,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:34,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1480145139, now seen corresponding path program 1 times [2025-03-17 19:24:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:34,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727303971] [2025-03-17 19:24:34,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:34,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:24:34,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:24:34,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:34,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:35,776 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:24:35,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727303971] [2025-03-17 19:24:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727303971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:35,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:24:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116639580] [2025-03-17 19:24:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:35,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:24:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:35,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:24:35,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:24:35,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:35,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 82 transitions, 341 flow. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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:24:35,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:35,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:35,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:36,823 INFO L124 PetriNetUnfolderBase]: 1548/3416 cut-off events. [2025-03-17 19:24:36,823 INFO L125 PetriNetUnfolderBase]: For 2991/2997 co-relation queries the response was YES. [2025-03-17 19:24:36,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9224 conditions, 3416 events. 1548/3416 cut-off events. For 2991/2997 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 20790 event pairs, 308 based on Foata normal form. 36/3376 useless extension candidates. Maximal degree in co-relation 9200. Up to 1420 conditions per place. [2025-03-17 19:24:36,841 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 101 selfloop transitions, 9 changer transitions 8/143 dead transitions. [2025-03-17 19:24:36,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 143 transitions, 836 flow [2025-03-17 19:24:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:24:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:24:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 356 transitions. [2025-03-17 19:24:36,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536144578313253 [2025-03-17 19:24:36,843 INFO L175 Difference]: Start difference. First operand has 109 places, 82 transitions, 341 flow. Second operand 8 states and 356 transitions. [2025-03-17 19:24:36,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 143 transitions, 836 flow [2025-03-17 19:24:36,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 143 transitions, 816 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-17 19:24:36,851 INFO L231 Difference]: Finished difference. Result has 106 places, 77 transitions, 305 flow [2025-03-17 19:24:36,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=305, PETRI_PLACES=106, PETRI_TRANSITIONS=77} [2025-03-17 19:24:36,852 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2025-03-17 19:24:36,852 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 77 transitions, 305 flow [2025-03-17 19:24:36,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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:24:36,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:36,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:36,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:24:36,852 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:36,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 688859205, now seen corresponding path program 1 times [2025-03-17 19:24:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:36,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970883013] [2025-03-17 19:24:36,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:36,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:24:36,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:24:36,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:36,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:38,903 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:24:38,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:38,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970883013] [2025-03-17 19:24:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970883013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:38,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:38,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:24:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006774940] [2025-03-17 19:24:38,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:24:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:38,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:24:38,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:24:38,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-03-17 19:24:38,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 77 transitions, 305 flow. Second operand has 11 states, 11 states have (on average 28.454545454545453) internal successors, (313), 11 states have internal predecessors, (313), 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:24:38,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:38,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-03-17 19:24:38,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:40,324 INFO L124 PetriNetUnfolderBase]: 1809/3899 cut-off events. [2025-03-17 19:24:40,325 INFO L125 PetriNetUnfolderBase]: For 3453/3453 co-relation queries the response was YES. [2025-03-17 19:24:40,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10552 conditions, 3899 events. 1809/3899 cut-off events. For 3453/3453 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23185 event pairs, 260 based on Foata normal form. 26/3818 useless extension candidates. Maximal degree in co-relation 10532. Up to 1079 conditions per place. [2025-03-17 19:24:40,343 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 151 selfloop transitions, 12 changer transitions 10/194 dead transitions. [2025-03-17 19:24:40,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 194 transitions, 1163 flow [2025-03-17 19:24:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:24:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:24:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 483 transitions. [2025-03-17 19:24:40,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44763670064874883 [2025-03-17 19:24:40,344 INFO L175 Difference]: Start difference. First operand has 106 places, 77 transitions, 305 flow. Second operand 13 states and 483 transitions. [2025-03-17 19:24:40,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 194 transitions, 1163 flow [2025-03-17 19:24:40,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 194 transitions, 1145 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 19:24:40,352 INFO L231 Difference]: Finished difference. Result has 115 places, 81 transitions, 343 flow [2025-03-17 19:24:40,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=115, PETRI_TRANSITIONS=81} [2025-03-17 19:24:40,353 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 38 predicate places. [2025-03-17 19:24:40,353 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 81 transitions, 343 flow [2025-03-17 19:24:40,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.454545454545453) internal successors, (313), 11 states have internal predecessors, (313), 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:24:40,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:40,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:40,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 19:24:40,353 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:40,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash -120198852, now seen corresponding path program 1 times [2025-03-17 19:24:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345641963] [2025-03-17 19:24:40,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:40,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 19:24:40,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 19:24:40,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:40,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:40,853 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:24:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345641963] [2025-03-17 19:24:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345641963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:40,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:40,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:24:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383582113] [2025-03-17 19:24:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:24:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:24:40,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:24:40,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-17 19:24:40,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 81 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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:24:40,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:40,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-17 19:24:40,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:41,332 INFO L124 PetriNetUnfolderBase]: 1676/3752 cut-off events. [2025-03-17 19:24:41,332 INFO L125 PetriNetUnfolderBase]: For 3706/3706 co-relation queries the response was YES. [2025-03-17 19:24:41,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10211 conditions, 3752 events. 1676/3752 cut-off events. For 3706/3706 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23001 event pairs, 1059 based on Foata normal form. 35/3705 useless extension candidates. Maximal degree in co-relation 10188. Up to 2112 conditions per place. [2025-03-17 19:24:41,348 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 58 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2025-03-17 19:24:41,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 95 transitions, 544 flow [2025-03-17 19:24:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:24:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:24:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-03-17 19:24:41,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2025-03-17 19:24:41,349 INFO L175 Difference]: Start difference. First operand has 115 places, 81 transitions, 343 flow. Second operand 5 states and 225 transitions. [2025-03-17 19:24:41,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 95 transitions, 544 flow [2025-03-17 19:24:41,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 95 transitions, 524 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-17 19:24:41,357 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 336 flow [2025-03-17 19:24:41,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=336, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2025-03-17 19:24:41,357 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 30 predicate places. [2025-03-17 19:24:41,357 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 336 flow [2025-03-17 19:24:41,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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:24:41,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:41,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:41,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 19:24:41,358 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:41,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1249509302, now seen corresponding path program 1 times [2025-03-17 19:24:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288743483] [2025-03-17 19:24:41,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:41,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:24:41,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:24:41,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:41,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:42,461 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:24:42,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288743483] [2025-03-17 19:24:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288743483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:42,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:24:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822964478] [2025-03-17 19:24:42,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:42,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:24:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:42,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:24:42,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:24:42,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-17 19:24:42,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 336 flow. Second operand has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 states have internal predecessors, (335), 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:24:42,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:42,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-17 19:24:42,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:43,192 INFO L124 PetriNetUnfolderBase]: 1821/3921 cut-off events. [2025-03-17 19:24:43,192 INFO L125 PetriNetUnfolderBase]: For 3765/3772 co-relation queries the response was YES. [2025-03-17 19:24:43,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10754 conditions, 3921 events. 1821/3921 cut-off events. For 3765/3772 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 23122 event pairs, 249 based on Foata normal form. 26/3857 useless extension candidates. Maximal degree in co-relation 10731. Up to 847 conditions per place. [2025-03-17 19:24:43,208 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 134 selfloop transitions, 12 changer transitions 6/176 dead transitions. [2025-03-17 19:24:43,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 176 transitions, 1053 flow [2025-03-17 19:24:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:24:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:24:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 502 transitions. [2025-03-17 19:24:43,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5498357064622125 [2025-03-17 19:24:43,210 INFO L175 Difference]: Start difference. First operand has 107 places, 79 transitions, 336 flow. Second operand 11 states and 502 transitions. [2025-03-17 19:24:43,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 176 transitions, 1053 flow [2025-03-17 19:24:43,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 176 transitions, 1029 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:24:43,218 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 371 flow [2025-03-17 19:24:43,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=371, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-03-17 19:24:43,218 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 39 predicate places. [2025-03-17 19:24:43,219 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 371 flow [2025-03-17 19:24:43,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 states have internal predecessors, (335), 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:24:43,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:43,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 19:24:43,219 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 80084982, now seen corresponding path program 1 times [2025-03-17 19:24:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991621939] [2025-03-17 19:24:43,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:43,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 19:24:43,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:24:43,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:43,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:44,525 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:24:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991621939] [2025-03-17 19:24:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991621939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 19:24:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643127872] [2025-03-17 19:24:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:24:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:44,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:24:44,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:24:44,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-03-17 19:24:44,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 371 flow. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 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:24:44,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:44,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-03-17 19:24:44,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:45,323 INFO L124 PetriNetUnfolderBase]: 1819/3893 cut-off events. [2025-03-17 19:24:45,323 INFO L125 PetriNetUnfolderBase]: For 3921/3928 co-relation queries the response was YES. [2025-03-17 19:24:45,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10920 conditions, 3893 events. 1819/3893 cut-off events. For 3921/3928 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22799 event pairs, 272 based on Foata normal form. 26/3899 useless extension candidates. Maximal degree in co-relation 10895. Up to 992 conditions per place. [2025-03-17 19:24:45,340 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 141 selfloop transitions, 14 changer transitions 18/195 dead transitions. [2025-03-17 19:24:45,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 195 transitions, 1206 flow [2025-03-17 19:24:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:24:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:24:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 532 transitions. [2025-03-17 19:24:45,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49304911955514363 [2025-03-17 19:24:45,341 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 371 flow. Second operand 13 states and 532 transitions. [2025-03-17 19:24:45,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 195 transitions, 1206 flow [2025-03-17 19:24:45,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 195 transitions, 1194 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 19:24:45,350 INFO L231 Difference]: Finished difference. Result has 123 places, 84 transitions, 389 flow [2025-03-17 19:24:45,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=389, PETRI_PLACES=123, PETRI_TRANSITIONS=84} [2025-03-17 19:24:45,351 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 46 predicate places. [2025-03-17 19:24:45,351 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 84 transitions, 389 flow [2025-03-17 19:24:45,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 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:24:45,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:45,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:45,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 19:24:45,351 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:45,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash -643264751, now seen corresponding path program 1 times [2025-03-17 19:24:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:45,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3566619] [2025-03-17 19:24:45,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:45,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:24:45,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:24:45,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:45,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:46,844 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:24:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3566619] [2025-03-17 19:24:46,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3566619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:24:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12808369] [2025-03-17 19:24:46,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:24:46,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:24:46,847 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:24:46,849 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:24:46,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:24:47,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:24:47,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:47,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:47,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-17 19:24:47,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:24:47,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-17 19:24:47,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 19:24:47,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-03-17 19:24:47,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-17 19:24:47,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 19:24:47,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 19:24:47,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 19:24:47,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:24:47,642 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:24:47,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:24:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:24:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12808369] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 19:24:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 19:24:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10, 11] total 31 [2025-03-17 19:24:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304579495] [2025-03-17 19:24:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:24:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:48,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:24:48,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2025-03-17 19:24:48,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-17 19:24:48,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 84 transitions, 389 flow. Second operand has 13 states, 13 states have (on average 34.61538461538461) internal successors, (450), 13 states have internal predecessors, (450), 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:24:48,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:48,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-17 19:24:48,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:50,767 INFO L124 PetriNetUnfolderBase]: 1726/3795 cut-off events. [2025-03-17 19:24:50,767 INFO L125 PetriNetUnfolderBase]: For 4000/4007 co-relation queries the response was YES. [2025-03-17 19:24:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 3795 events. 1726/3795 cut-off events. For 4000/4007 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 22456 event pairs, 834 based on Foata normal form. 26/3793 useless extension candidates. Maximal degree in co-relation 10751. Up to 1325 conditions per place. [2025-03-17 19:24:50,779 INFO L140 encePairwiseOnDemand]: 65/83 looper letters, 102 selfloop transitions, 18 changer transitions 13/157 dead transitions. [2025-03-17 19:24:50,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 157 transitions, 980 flow [2025-03-17 19:24:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:24:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 19:24:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 462 transitions. [2025-03-17 19:24:50,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-03-17 19:24:50,781 INFO L175 Difference]: Start difference. First operand has 123 places, 84 transitions, 389 flow. Second operand 11 states and 462 transitions. [2025-03-17 19:24:50,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 157 transitions, 980 flow [2025-03-17 19:24:50,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 157 transitions, 953 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-17 19:24:50,789 INFO L231 Difference]: Finished difference. Result has 122 places, 83 transitions, 392 flow [2025-03-17 19:24:50,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=122, PETRI_TRANSITIONS=83} [2025-03-17 19:24:50,789 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 45 predicate places. [2025-03-17 19:24:50,790 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 83 transitions, 392 flow [2025-03-17 19:24:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.61538461538461) internal successors, (450), 13 states have internal predecessors, (450), 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:24:50,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:50,790 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:50,798 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:24:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:24:50,991 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash -73375567, now seen corresponding path program 1 times [2025-03-17 19:24:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636082595] [2025-03-17 19:24:50,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:51,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:24:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:24:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:51,594 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:24:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636082595] [2025-03-17 19:24:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636082595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:24:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261975116] [2025-03-17 19:24:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:51,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:24:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:51,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:24:51,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:24:51,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-03-17 19:24:51,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 83 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:51,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:51,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-03-17 19:24:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:52,560 INFO L124 PetriNetUnfolderBase]: 2010/4259 cut-off events. [2025-03-17 19:24:52,560 INFO L125 PetriNetUnfolderBase]: For 4243/4243 co-relation queries the response was YES. [2025-03-17 19:24:52,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12239 conditions, 4259 events. 2010/4259 cut-off events. For 4243/4243 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 25073 event pairs, 438 based on Foata normal form. 12/4251 useless extension candidates. Maximal degree in co-relation 12212. Up to 1823 conditions per place. [2025-03-17 19:24:52,575 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 110 selfloop transitions, 20 changer transitions 1/151 dead transitions. [2025-03-17 19:24:52,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 151 transitions, 946 flow [2025-03-17 19:24:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:24:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 19:24:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2025-03-17 19:24:52,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4685408299866131 [2025-03-17 19:24:52,576 INFO L175 Difference]: Start difference. First operand has 122 places, 83 transitions, 392 flow. Second operand 9 states and 350 transitions. [2025-03-17 19:24:52,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 151 transitions, 946 flow [2025-03-17 19:24:52,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 151 transitions, 912 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-17 19:24:52,585 INFO L231 Difference]: Finished difference. Result has 119 places, 86 transitions, 415 flow [2025-03-17 19:24:52,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=415, PETRI_PLACES=119, PETRI_TRANSITIONS=86} [2025-03-17 19:24:52,585 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 42 predicate places. [2025-03-17 19:24:52,585 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 86 transitions, 415 flow [2025-03-17 19:24:52,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:24:52,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:52,586 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:52,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 19:24:52,586 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1297725872, now seen corresponding path program 1 times [2025-03-17 19:24:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754053972] [2025-03-17 19:24:52,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:52,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:24:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:24:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:55,145 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:24:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754053972] [2025-03-17 19:24:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754053972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:24:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:24:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 19:24:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758665244] [2025-03-17 19:24:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:24:55,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:24:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:24:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:24:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:24:55,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-03-17 19:24:55,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 86 transitions, 415 flow. Second operand has 15 states, 15 states have (on average 28.4) internal successors, (426), 15 states have internal predecessors, (426), 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:24:55,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:24:55,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-03-17 19:24:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:24:57,043 INFO L124 PetriNetUnfolderBase]: 2274/4907 cut-off events. [2025-03-17 19:24:57,044 INFO L125 PetriNetUnfolderBase]: For 4990/4990 co-relation queries the response was YES. [2025-03-17 19:24:57,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 4907 events. 2274/4907 cut-off events. For 4990/4990 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 28401 event pairs, 411 based on Foata normal form. 12/4893 useless extension candidates. Maximal degree in co-relation 13897. Up to 1014 conditions per place. [2025-03-17 19:24:57,063 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 191 selfloop transitions, 20 changer transitions 12/246 dead transitions. [2025-03-17 19:24:57,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 246 transitions, 1598 flow [2025-03-17 19:24:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 19:24:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 19:24:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 593 transitions. [2025-03-17 19:24:57,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44653614457831325 [2025-03-17 19:24:57,064 INFO L175 Difference]: Start difference. First operand has 119 places, 86 transitions, 415 flow. Second operand 16 states and 593 transitions. [2025-03-17 19:24:57,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 246 transitions, 1598 flow [2025-03-17 19:24:57,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 246 transitions, 1570 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-17 19:24:57,074 INFO L231 Difference]: Finished difference. Result has 135 places, 93 transitions, 517 flow [2025-03-17 19:24:57,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=517, PETRI_PLACES=135, PETRI_TRANSITIONS=93} [2025-03-17 19:24:57,074 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 58 predicate places. [2025-03-17 19:24:57,074 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 93 transitions, 517 flow [2025-03-17 19:24:57,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.4) internal successors, (426), 15 states have internal predecessors, (426), 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:24:57,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:24:57,074 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:24:57,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 19:24:57,074 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-17 19:24:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:24:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1552539918, now seen corresponding path program 1 times [2025-03-17 19:24:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:24:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510882024] [2025-03-17 19:24:57,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:24:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 19:24:57,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 19:24:57,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:57,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:58,800 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:24:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:24:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510882024] [2025-03-17 19:24:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510882024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:24:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667649848] [2025-03-17 19:24:58,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:24:58,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:24:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:24:58,804 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:24:58,804 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:24:58,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 19:24:59,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 19:24:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:24:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:24:59,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 19:24:59,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:24:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2025-03-17 19:24:59,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,184 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:24:59,212 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2025-03-17 19:24:59,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2025-03-17 19:24:59,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,266 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:24:59,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2025-03-17 19:24:59,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-17 19:24:59,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,387 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:24:59,400 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-17 19:24:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-03-17 19:24:59,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-03-17 19:24:59,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2025-03-17 19:24:59,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:24:59,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-03-17 19:24:59,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:24:59,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 21 [2025-03-17 19:24:59,736 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-17 19:24:59,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-03-17 19:24:59,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2025-03-17 19:24:59,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 19:24:59,781 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:24:59,782 INFO L312 TraceCheckSpWp]: Computing backward predicates...