./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:32:38,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:32:38,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:32:38,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:32:38,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:32:39,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:32:39,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:32:39,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:32:39,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:32:39,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:32:39,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:32:39,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:32:39,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:32:39,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:32:39,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:32:39,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:32:39,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:39,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:39,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:32:39,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:32:39,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-01-10 06:32:39,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:32:39,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:32:39,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:32:39,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:32:39,414 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:32:39,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-01-10 06:32:40,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/160286d59/09e302cf0d6145ce8a312daf9b953e8e/FLAG48c4221c5 [2025-01-10 06:32:41,014 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:32:41,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-01-10 06:32:41,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/160286d59/09e302cf0d6145ce8a312daf9b953e8e/FLAG48c4221c5 [2025-01-10 06:32:41,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/160286d59/09e302cf0d6145ce8a312daf9b953e8e [2025-01-10 06:32:41,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:32:41,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:32:41,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:41,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:32:41,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:32:41,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41, skipping insertion in model container [2025-01-10 06:32:41,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:32:41,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:41,391 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:32:41,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:41,475 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:32:41,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41 WrapperNode [2025-01-10 06:32:41,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:41,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:41,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:32:41,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:32:41,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,505 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 247 [2025-01-10 06:32:41,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:41,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:32:41,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:32:41,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:32:41,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,525 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-01-10 06:32:41,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:32:41,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:32:41,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:32:41,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:32:41,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (1/1) ... [2025-01-10 06:32:41,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:41,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:41,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:32:41,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:32:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 06:32:41,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 06:32:41,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:32:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:32:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:32:41,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:32:41,580 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:32:41,677 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:32:41,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:32:41,961 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:32:41,962 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:32:42,338 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:32:42,338 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:32:42,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:42 BoogieIcfgContainer [2025-01-10 06:32:42,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:32:42,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:32:42,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:32:42,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:32:42,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:32:41" (1/3) ... [2025-01-10 06:32:42,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485c80db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:42, skipping insertion in model container [2025-01-10 06:32:42,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:41" (2/3) ... [2025-01-10 06:32:42,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485c80db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:42, skipping insertion in model container [2025-01-10 06:32:42,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:42" (3/3) ... [2025-01-10 06:32:42,349 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-01-10 06:32:42,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:32:42,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-01-10 06:32:42,367 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:32:42,428 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:32:42,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 136 flow [2025-01-10 06:32:42,481 INFO L124 PetriNetUnfolderBase]: 7/59 cut-off events. [2025-01-10 06:32:42,482 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:32:42,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 7/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 173 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-01-10 06:32:42,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 61 transitions, 136 flow [2025-01-10 06:32:42,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 123 flow [2025-01-10 06:32:42,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:42,498 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;@11fcae85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:42,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-10 06:32:42,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:42,504 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-01-10 06:32:42,504 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:32:42,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:42,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:42,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:42,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash -679428765, now seen corresponding path program 1 times [2025-01-10 06:32:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:42,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567164241] [2025-01-10 06:32:42,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:42,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:32:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:32:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567164241] [2025-01-10 06:32:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567164241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938404382] [2025-01-10 06:32:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:43,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:43,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:43,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:43,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:32:43,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:43,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:43,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:32:43,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:43,868 INFO L124 PetriNetUnfolderBase]: 1019/2078 cut-off events. [2025-01-10 06:32:43,869 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-10 06:32:43,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 2078 events. 1019/2078 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13402 event pairs, 215 based on Foata normal form. 42/1748 useless extension candidates. Maximal degree in co-relation 3596. Up to 1122 conditions per place. [2025-01-10 06:32:43,886 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 81 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-01-10 06:32:43,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 408 flow [2025-01-10 06:32:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2025-01-10 06:32:43,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6754098360655738 [2025-01-10 06:32:43,898 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 5 states and 206 transitions. [2025-01-10 06:32:43,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 408 flow [2025-01-10 06:32:43,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 108 transitions, 399 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:43,908 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 164 flow [2025-01-10 06:32:43,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2025-01-10 06:32:43,913 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2025-01-10 06:32:43,913 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 164 flow [2025-01-10 06:32:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:43,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:43,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:43,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:32:43,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:43,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1319214131, now seen corresponding path program 1 times [2025-01-10 06:32:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:43,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126110462] [2025-01-10 06:32:43,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:43,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:32:43,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:32:43,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:44,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126110462] [2025-01-10 06:32:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126110462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:44,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:44,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:44,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079525647] [2025-01-10 06:32:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:44,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:44,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:44,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:44,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-01-10 06:32:44,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:44,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:44,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-01-10 06:32:44,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:44,718 INFO L124 PetriNetUnfolderBase]: 1304/2561 cut-off events. [2025-01-10 06:32:44,718 INFO L125 PetriNetUnfolderBase]: For 355/363 co-relation queries the response was YES. [2025-01-10 06:32:44,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 2561 events. 1304/2561 cut-off events. For 355/363 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16124 event pairs, 197 based on Foata normal form. 8/2145 useless extension candidates. Maximal degree in co-relation 4709. Up to 1022 conditions per place. [2025-01-10 06:32:44,726 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 118 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2025-01-10 06:32:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 152 transitions, 631 flow [2025-01-10 06:32:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:32:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:32:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 287 transitions. [2025-01-10 06:32:44,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-01-10 06:32:44,728 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 164 flow. Second operand 7 states and 287 transitions. [2025-01-10 06:32:44,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 152 transitions, 631 flow [2025-01-10 06:32:44,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 152 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:32:44,733 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 256 flow [2025-01-10 06:32:44,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2025-01-10 06:32:44,734 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2025-01-10 06:32:44,734 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 256 flow [2025-01-10 06:32:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:44,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:44,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:44,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:32:44,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1827254373, now seen corresponding path program 1 times [2025-01-10 06:32:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98062615] [2025-01-10 06:32:44,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:44,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:32:44,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:32:44,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:44,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:44,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98062615] [2025-01-10 06:32:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98062615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591710439] [2025-01-10 06:32:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:44,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:32:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:44,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:32:44,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:32:44,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-01-10 06:32:44,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:44,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:44,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-01-10 06:32:44,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:44,895 INFO L124 PetriNetUnfolderBase]: 515/1171 cut-off events. [2025-01-10 06:32:44,896 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2025-01-10 06:32:44,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 1171 events. 515/1171 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6917 event pairs, 296 based on Foata normal form. 29/1106 useless extension candidates. Maximal degree in co-relation 2437. Up to 510 conditions per place. [2025-01-10 06:32:44,901 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 42 selfloop transitions, 2 changer transitions 6/74 dead transitions. [2025-01-10 06:32:44,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 335 flow [2025-01-10 06:32:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:32:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:32:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-01-10 06:32:44,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-01-10 06:32:44,903 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 256 flow. Second operand 3 states and 120 transitions. [2025-01-10 06:32:44,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 335 flow [2025-01-10 06:32:44,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 314 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:44,907 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 197 flow [2025-01-10 06:32:44,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 06:32:44,907 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-01-10 06:32:44,908 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 197 flow [2025-01-10 06:32:44,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:44,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:44,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:44,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:32:44,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:44,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2054034201, now seen corresponding path program 1 times [2025-01-10 06:32:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:44,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971618991] [2025-01-10 06:32:44,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:32:44,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:32:44,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:44,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971618991] [2025-01-10 06:32:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971618991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:45,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174667785] [2025-01-10 06:32:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:45,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:45,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:45,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:32:45,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:45,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:45,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:32:45,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:45,349 INFO L124 PetriNetUnfolderBase]: 505/1125 cut-off events. [2025-01-10 06:32:45,350 INFO L125 PetriNetUnfolderBase]: For 203/207 co-relation queries the response was YES. [2025-01-10 06:32:45,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1125 events. 505/1125 cut-off events. For 203/207 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6472 event pairs, 179 based on Foata normal form. 14/1061 useless extension candidates. Maximal degree in co-relation 2207. Up to 476 conditions per place. [2025-01-10 06:32:45,355 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 71 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2025-01-10 06:32:45,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 441 flow [2025-01-10 06:32:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-01-10 06:32:45,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592896174863388 [2025-01-10 06:32:45,357 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 197 flow. Second operand 6 states and 217 transitions. [2025-01-10 06:32:45,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 441 flow [2025-01-10 06:32:45,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 100 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:32:45,361 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 211 flow [2025-01-10 06:32:45,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2025-01-10 06:32:45,362 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-01-10 06:32:45,362 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 211 flow [2025-01-10 06:32:45,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:45,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:45,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:45,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:32:45,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:45,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2054033207, now seen corresponding path program 1 times [2025-01-10 06:32:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142824130] [2025-01-10 06:32:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:45,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:32:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:32:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142824130] [2025-01-10 06:32:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142824130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:45,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:45,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:45,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733042363] [2025-01-10 06:32:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:45,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:45,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:45,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:45,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:32:45,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:45,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:45,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:32:45,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:45,557 INFO L124 PetriNetUnfolderBase]: 440/978 cut-off events. [2025-01-10 06:32:45,558 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-01-10 06:32:45,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 978 events. 440/978 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5171 event pairs, 293 based on Foata normal form. 24/943 useless extension candidates. Maximal degree in co-relation 2000. Up to 591 conditions per place. [2025-01-10 06:32:45,563 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 53 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-01-10 06:32:45,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 354 flow [2025-01-10 06:32:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-01-10 06:32:45,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6188524590163934 [2025-01-10 06:32:45,564 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 211 flow. Second operand 4 states and 151 transitions. [2025-01-10 06:32:45,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 354 flow [2025-01-10 06:32:45,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 334 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 06:32:45,568 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 210 flow [2025-01-10 06:32:45,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2025-01-10 06:32:45,568 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-01-10 06:32:45,568 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 210 flow [2025-01-10 06:32:45,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:45,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:45,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:32:45,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:45,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1303507048, now seen corresponding path program 1 times [2025-01-10 06:32:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209929231] [2025-01-10 06:32:45,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:45,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:32:45,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:32:45,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:45,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209929231] [2025-01-10 06:32:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209929231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:32:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614898035] [2025-01-10 06:32:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:45,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-01-10 06:32:45,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:45,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:45,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-01-10 06:32:45,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:46,000 INFO L124 PetriNetUnfolderBase]: 398/936 cut-off events. [2025-01-10 06:32:46,000 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2025-01-10 06:32:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 936 events. 398/936 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4961 event pairs, 118 based on Foata normal form. 12/907 useless extension candidates. Maximal degree in co-relation 1521. Up to 457 conditions per place. [2025-01-10 06:32:46,005 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 55 selfloop transitions, 5 changer transitions 3/87 dead transitions. [2025-01-10 06:32:46,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 388 flow [2025-01-10 06:32:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-01-10 06:32:46,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131147540983607 [2025-01-10 06:32:46,007 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 210 flow. Second operand 5 states and 187 transitions. [2025-01-10 06:32:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 388 flow [2025-01-10 06:32:46,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:46,010 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 215 flow [2025-01-10 06:32:46,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2025-01-10 06:32:46,012 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-01-10 06:32:46,012 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 215 flow [2025-01-10 06:32:46,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:46,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:46,013 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:46,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:32:46,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1232484618, now seen corresponding path program 1 times [2025-01-10 06:32:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102718438] [2025-01-10 06:32:46,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:46,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:32:46,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:32:46,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:46,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:46,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102718438] [2025-01-10 06:32:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102718438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:32:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236110624] [2025-01-10 06:32:46,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:46,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:46,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:46,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:32:46,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:32:46,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:32:46,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:32:46,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:46,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:46,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:32:46,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:32:46,713 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 19 treesize of output 1 [2025-01-10 06:32:46,754 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 31 treesize of output 15 [2025-01-10 06:32:46,803 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 34 treesize of output 28 [2025-01-10 06:32:46,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:32:46,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 38 treesize of output 22 [2025-01-10 06:32:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:46,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:32:47,026 INFO L349 Elim1Store]: treesize reduction 47, result has 53.5 percent of original size [2025-01-10 06:32:47,027 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 3 case distinctions, treesize of input 438 treesize of output 343 [2025-01-10 06:32:47,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:32:47,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 179 treesize of output 169 [2025-01-10 06:32:47,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2025-01-10 06:32:47,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:32:47,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 180 [2025-01-10 06:32:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236110624] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:32:47,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:32:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-01-10 06:32:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443810516] [2025-01-10 06:32:47,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:32:47,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 06:32:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:47,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 06:32:47,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 06:32:47,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-01-10 06:32:47,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 215 flow. Second operand has 17 states, 17 states have (on average 24.41176470588235) internal successors, (415), 17 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:47,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:47,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-01-10 06:32:47,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:47,910 INFO L124 PetriNetUnfolderBase]: 592/1325 cut-off events. [2025-01-10 06:32:47,910 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-01-10 06:32:47,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1325 events. 592/1325 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7087 event pairs, 123 based on Foata normal form. 12/1252 useless extension candidates. Maximal degree in co-relation 2258. Up to 211 conditions per place. [2025-01-10 06:32:47,916 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 94 selfloop transitions, 10 changer transitions 3/128 dead transitions. [2025-01-10 06:32:47,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 128 transitions, 579 flow [2025-01-10 06:32:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:32:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:32:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 328 transitions. [2025-01-10 06:32:47,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377049180327869 [2025-01-10 06:32:47,917 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 215 flow. Second operand 10 states and 328 transitions. [2025-01-10 06:32:47,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 128 transitions, 579 flow [2025-01-10 06:32:47,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 569 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:47,920 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 231 flow [2025-01-10 06:32:47,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2025-01-10 06:32:47,921 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2025-01-10 06:32:47,921 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 231 flow [2025-01-10 06:32:47,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 24.41176470588235) internal successors, (415), 17 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:47,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:47,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:47,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:32:48,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:48,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 447683197, now seen corresponding path program 1 times [2025-01-10 06:32:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:48,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388963735] [2025-01-10 06:32:48,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:48,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:32:48,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:32:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:48,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388963735] [2025-01-10 06:32:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388963735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:32:48,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245662775] [2025-01-10 06:32:48,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:48,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:48,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:48,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:32:48,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:32:48,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:32:48,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:32:48,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:48,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:48,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 06:32:48,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:32:48,784 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 41 treesize of output 1 [2025-01-10 06:32:48,846 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:32:48,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:32:48,864 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-01-10 06:32:48,865 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-01-10 06:32:48,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:32:48,918 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:32:48,919 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-01-10 06:32:48,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:32:48,998 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 55 treesize of output 27 [2025-01-10 06:32:49,041 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 41 treesize of output 33 [2025-01-10 06:32:49,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:32:49,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 43 treesize of output 23 [2025-01-10 06:32:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:49,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:32:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245662775] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:32:54,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:32:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-01-10 06:32:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828875777] [2025-01-10 06:32:54,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:32:54,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:32:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:54,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:32:54,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=262, Unknown=3, NotChecked=0, Total=342 [2025-01-10 06:32:55,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:32:57,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:32:57,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2025-01-10 06:32:57,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 231 flow. Second operand has 19 states, 19 states have (on average 21.42105263157895) internal successors, (407), 19 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:57,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:57,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2025-01-10 06:32:57,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:04,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:08,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:11,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:13,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:15,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:16,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:18,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:20,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:22,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:24,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:25,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:27,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:30,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:33,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:35,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:37,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:40,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:42,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:44,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:46,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:48,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:51,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:53,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:53,294 INFO L124 PetriNetUnfolderBase]: 1211/2528 cut-off events. [2025-01-10 06:33:53,295 INFO L125 PetriNetUnfolderBase]: For 541/541 co-relation queries the response was YES. [2025-01-10 06:33:53,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5890 conditions, 2528 events. 1211/2528 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 15004 event pairs, 163 based on Foata normal form. 36/2437 useless extension candidates. Maximal degree in co-relation 4785. Up to 626 conditions per place. [2025-01-10 06:33:53,307 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 187 selfloop transitions, 21 changer transitions 3/228 dead transitions. [2025-01-10 06:33:53,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 228 transitions, 1105 flow [2025-01-10 06:33:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:33:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:33:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 536 transitions. [2025-01-10 06:33:53,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5168756027000965 [2025-01-10 06:33:53,310 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 231 flow. Second operand 17 states and 536 transitions. [2025-01-10 06:33:53,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 228 transitions, 1105 flow [2025-01-10 06:33:53,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 228 transitions, 1070 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-01-10 06:33:53,315 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 344 flow [2025-01-10 06:33:53,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=344, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-01-10 06:33:53,316 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2025-01-10 06:33:53,316 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 344 flow [2025-01-10 06:33:53,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 21.42105263157895) internal successors, (407), 19 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:53,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:53,316 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:53,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:33:53,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:53,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:53,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 726844864, now seen corresponding path program 1 times [2025-01-10 06:33:53,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:53,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974108988] [2025-01-10 06:33:53,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:53,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:33:53,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:33:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974108988] [2025-01-10 06:33:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974108988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898502897] [2025-01-10 06:33:53,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:53,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:53,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:53,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:53,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:33:53,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:33:54,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:33:54,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:54,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 06:33:54,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:54,132 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 43 treesize of output 21 [2025-01-10 06:33:54,183 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:54,184 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 57 treesize of output 41 [2025-01-10 06:33:54,219 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 41 treesize of output 19 [2025-01-10 06:33:54,229 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 31 treesize of output 13 [2025-01-10 06:33:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:54,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:54,451 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-01-10 06:33:54,451 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 85 [2025-01-10 06:33:54,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:54,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 86 treesize of output 82 [2025-01-10 06:33:54,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2025-01-10 06:33:54,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:54,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 56 treesize of output 44 [2025-01-10 06:33:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898502897] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:54,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:54,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2025-01-10 06:33:54,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254209888] [2025-01-10 06:33:54,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:54,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:33:54,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:54,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:33:54,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:33:54,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-01-10 06:33:54,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 344 flow. Second operand has 23 states, 23 states have (on average 24.08695652173913) internal successors, (554), 23 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:54,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:54,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-01-10 06:33:54,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:55,413 INFO L124 PetriNetUnfolderBase]: 1022/2291 cut-off events. [2025-01-10 06:33:55,413 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2025-01-10 06:33:55,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5509 conditions, 2291 events. 1022/2291 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 13569 event pairs, 163 based on Foata normal form. 84/2250 useless extension candidates. Maximal degree in co-relation 5373. Up to 434 conditions per place. [2025-01-10 06:33:55,423 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 133 selfloop transitions, 28 changer transitions 3/183 dead transitions. [2025-01-10 06:33:55,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 183 transitions, 915 flow [2025-01-10 06:33:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:33:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:33:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 510 transitions. [2025-01-10 06:33:55,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225409836065574 [2025-01-10 06:33:55,428 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 344 flow. Second operand 16 states and 510 transitions. [2025-01-10 06:33:55,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 183 transitions, 915 flow [2025-01-10 06:33:55,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 183 transitions, 882 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-01-10 06:33:55,432 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 367 flow [2025-01-10 06:33:55,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=367, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2025-01-10 06:33:55,434 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2025-01-10 06:33:55,434 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 367 flow [2025-01-10 06:33:55,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 24.08695652173913) internal successors, (554), 23 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:55,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:55,434 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:55,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:33:55,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:55,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1789069954, now seen corresponding path program 1 times [2025-01-10 06:33:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970689188] [2025-01-10 06:33:55,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:55,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:33:55,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:33:55,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:55,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:55,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:55,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970689188] [2025-01-10 06:33:55,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970689188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:55,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913918813] [2025-01-10 06:33:55,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:55,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:55,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:55,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:33:55,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:33:55,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:33:55,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:55,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:55,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:33:55,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:55,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:33:55,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913918813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:55,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:33:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:33:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882474813] [2025-01-10 06:33:55,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:55,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:55,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:55,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:55,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:33:55,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:55,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:55,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:33:55,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:56,094 INFO L124 PetriNetUnfolderBase]: 992/2221 cut-off events. [2025-01-10 06:33:56,094 INFO L125 PetriNetUnfolderBase]: For 1278/1278 co-relation queries the response was YES. [2025-01-10 06:33:56,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 2221 events. 992/2221 cut-off events. For 1278/1278 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 12995 event pairs, 183 based on Foata normal form. 36/2096 useless extension candidates. Maximal degree in co-relation 4541. Up to 1273 conditions per place. [2025-01-10 06:33:56,107 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 77 selfloop transitions, 7 changer transitions 3/107 dead transitions. [2025-01-10 06:33:56,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 608 flow [2025-01-10 06:33:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-01-10 06:33:56,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-01-10 06:33:56,109 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 367 flow. Second operand 6 states and 210 transitions. [2025-01-10 06:33:56,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 608 flow [2025-01-10 06:33:56,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 107 transitions, 570 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-01-10 06:33:56,113 INFO L231 Difference]: Finished difference. Result has 93 places, 76 transitions, 339 flow [2025-01-10 06:33:56,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=93, PETRI_TRANSITIONS=76} [2025-01-10 06:33:56,113 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 36 predicate places. [2025-01-10 06:33:56,114 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 76 transitions, 339 flow [2025-01-10 06:33:56,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:56,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:56,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:56,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:33:56,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:33:56,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:56,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:56,316 INFO L85 PathProgramCache]: Analyzing trace with hash 373406976, now seen corresponding path program 1 times [2025-01-10 06:33:56,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:56,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58670152] [2025-01-10 06:33:56,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:56,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:33:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:33:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:33:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58670152] [2025-01-10 06:33:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58670152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:56,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089466060] [2025-01-10 06:33:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:56,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:56,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:56,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:56,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:33:56,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 76 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:56,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:56,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:33:56,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:56,585 INFO L124 PetriNetUnfolderBase]: 947/2144 cut-off events. [2025-01-10 06:33:56,586 INFO L125 PetriNetUnfolderBase]: For 1282/1282 co-relation queries the response was YES. [2025-01-10 06:33:56,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 2144 events. 947/2144 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12558 event pairs, 508 based on Foata normal form. 36/2051 useless extension candidates. Maximal degree in co-relation 4040. Up to 1018 conditions per place. [2025-01-10 06:33:56,594 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 58 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2025-01-10 06:33:56,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 505 flow [2025-01-10 06:33:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 06:33:56,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5778688524590164 [2025-01-10 06:33:56,595 INFO L175 Difference]: Start difference. First operand has 93 places, 76 transitions, 339 flow. Second operand 4 states and 141 transitions. [2025-01-10 06:33:56,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 505 flow [2025-01-10 06:33:56,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 491 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:33:56,598 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 343 flow [2025-01-10 06:33:56,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=343, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2025-01-10 06:33:56,599 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2025-01-10 06:33:56,599 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 343 flow [2025-01-10 06:33:56,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:56,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:56,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:33:56,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:56,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1871674088, now seen corresponding path program 1 times [2025-01-10 06:33:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894269898] [2025-01-10 06:33:56,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:33:56,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:33:56,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:56,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894269898] [2025-01-10 06:33:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894269898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328723629] [2025-01-10 06:33:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:56,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:56,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:33:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:33:56,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:33:56,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:56,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:56,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:33:56,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:56,755 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 11 treesize of output 7 [2025-01-10 06:33:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:33:56,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:33:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328723629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:56,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:33:56,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-10 06:33:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425673947] [2025-01-10 06:33:56,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:56,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:56,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:56,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:56,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-01-10 06:33:56,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:56,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:56,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-01-10 06:33:56,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:56,913 INFO L124 PetriNetUnfolderBase]: 684/1717 cut-off events. [2025-01-10 06:33:56,913 INFO L125 PetriNetUnfolderBase]: For 983/983 co-relation queries the response was YES. [2025-01-10 06:33:56,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4194 conditions, 1717 events. 684/1717 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 9596 event pairs, 150 based on Foata normal form. 66/1698 useless extension candidates. Maximal degree in co-relation 2178. Up to 998 conditions per place. [2025-01-10 06:33:56,921 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 59 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-01-10 06:33:56,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 83 transitions, 488 flow [2025-01-10 06:33:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-01-10 06:33:56,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.644808743169399 [2025-01-10 06:33:56,922 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 343 flow. Second operand 3 states and 118 transitions. [2025-01-10 06:33:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 83 transitions, 488 flow [2025-01-10 06:33:56,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:56,926 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 336 flow [2025-01-10 06:33:56,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2025-01-10 06:33:56,927 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2025-01-10 06:33:56,927 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 336 flow [2025-01-10 06:33:56,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:56,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:56,927 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] [2025-01-10 06:33:56,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:33:57,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 06:33:57,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1117475104, now seen corresponding path program 1 times [2025-01-10 06:33:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587442832] [2025-01-10 06:33:57,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:33:57,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:33:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:57,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587442832] [2025-01-10 06:33:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587442832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:57,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917675957] [2025-01-10 06:33:57,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:57,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:57,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:57,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:57,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:33:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:33:57,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:33:57,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:57,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:57,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:33:57,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:57,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:57,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917675957] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:57,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:57,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:33:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222812452] [2025-01-10 06:33:57,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:57,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:33:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:57,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:33:57,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:33:57,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:33:57,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 336 flow. Second operand has 10 states, 10 states have (on average 26.5) internal successors, (265), 10 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:57,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:57,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:33:57,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:57,632 INFO L124 PetriNetUnfolderBase]: 540/1335 cut-off events. [2025-01-10 06:33:57,633 INFO L125 PetriNetUnfolderBase]: For 892/892 co-relation queries the response was YES. [2025-01-10 06:33:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1335 events. 540/1335 cut-off events. For 892/892 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6630 event pairs, 240 based on Foata normal form. 20/1288 useless extension candidates. Maximal degree in co-relation 1313. Up to 508 conditions per place. [2025-01-10 06:33:57,638 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 72 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2025-01-10 06:33:57,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 100 transitions, 554 flow [2025-01-10 06:33:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:33:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:33:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2025-01-10 06:33:57,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5480093676814989 [2025-01-10 06:33:57,640 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 336 flow. Second operand 7 states and 234 transitions. [2025-01-10 06:33:57,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 100 transitions, 554 flow [2025-01-10 06:33:57,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 546 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:57,643 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 354 flow [2025-01-10 06:33:57,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2025-01-10 06:33:57,644 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places. [2025-01-10 06:33:57,645 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 354 flow [2025-01-10 06:33:57,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.5) internal successors, (265), 10 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:57,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:57,645 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:57,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:33:57,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:33:57,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:57,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1427001927, now seen corresponding path program 1 times [2025-01-10 06:33:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338952332] [2025-01-10 06:33:57,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:57,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:33:57,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:33:57,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:57,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338952332] [2025-01-10 06:33:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338952332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127844028] [2025-01-10 06:33:58,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:58,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:58,672 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:58,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:33:58,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:33:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:33:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:58,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-10 06:33:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:58,802 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 41 treesize of output 1 [2025-01-10 06:33:58,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:58,847 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:58,848 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 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:33:58,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 06:33:58,948 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 31 treesize of output 15 [2025-01-10 06:33:58,980 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:58,989 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:58,989 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 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:33:59,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 06:33:59,100 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 31 treesize of output 15 [2025-01-10 06:33:59,136 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:59,137 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 45 treesize of output 35 [2025-01-10 06:33:59,157 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 29 treesize of output 13 [2025-01-10 06:33:59,164 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 19 treesize of output 7 [2025-01-10 06:33:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:59,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127844028] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:59,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:59,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2025-01-10 06:33:59,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891045849] [2025-01-10 06:33:59,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:59,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 06:33:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:59,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 06:33:59,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 06:33:59,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:33:59,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 354 flow. Second operand has 33 states, 33 states have (on average 24.87878787878788) internal successors, (821), 33 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:59,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:59,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:33:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:01,791 INFO L124 PetriNetUnfolderBase]: 1148/2803 cut-off events. [2025-01-10 06:34:01,791 INFO L125 PetriNetUnfolderBase]: For 2013/2013 co-relation queries the response was YES. [2025-01-10 06:34:01,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7523 conditions, 2803 events. 1148/2803 cut-off events. For 2013/2013 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16436 event pairs, 161 based on Foata normal form. 40/2716 useless extension candidates. Maximal degree in co-relation 3645. Up to 643 conditions per place. [2025-01-10 06:34:01,803 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 216 selfloop transitions, 41 changer transitions 8/284 dead transitions. [2025-01-10 06:34:01,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 284 transitions, 1579 flow [2025-01-10 06:34:01,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 06:34:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 06:34:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 876 transitions. [2025-01-10 06:34:01,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318761384335154 [2025-01-10 06:34:01,806 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 354 flow. Second operand 27 states and 876 transitions. [2025-01-10 06:34:01,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 284 transitions, 1579 flow [2025-01-10 06:34:01,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 284 transitions, 1575 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:01,813 INFO L231 Difference]: Finished difference. Result has 128 places, 103 transitions, 678 flow [2025-01-10 06:34:01,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=678, PETRI_PLACES=128, PETRI_TRANSITIONS=103} [2025-01-10 06:34:01,813 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 71 predicate places. [2025-01-10 06:34:01,813 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 103 transitions, 678 flow [2025-01-10 06:34:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 24.87878787878788) internal successors, (821), 33 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:01,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:01,814 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:01,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:02,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:02,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:34:02,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -578905221, now seen corresponding path program 1 times [2025-01-10 06:34:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:02,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005186965] [2025-01-10 06:34:02,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:02,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:34:02,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:34:02,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:02,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:02,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005186965] [2025-01-10 06:34:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005186965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394797332] [2025-01-10 06:34:02,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:02,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:02,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:02,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:34:02,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:34:02,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:34:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:02,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-10 06:34:02,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:02,795 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 35 treesize of output 9 [2025-01-10 06:34:02,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:34:02,835 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:34:02,836 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 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:34:02,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 06:34:02,905 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 23 treesize of output 13 [2025-01-10 06:34:02,935 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:34:02,943 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:34:02,943 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 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:34:02,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 06:34:03,017 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 23 treesize of output 13 [2025-01-10 06:34:03,047 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:34:03,054 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:34:03,054 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 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:34:03,083 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 9 treesize of output 3 [2025-01-10 06:34:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:03,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394797332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:03,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 30 [2025-01-10 06:34:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179857158] [2025-01-10 06:34:03,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:03,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 06:34:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:03,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 06:34:03,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2025-01-10 06:34:03,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:34:03,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 103 transitions, 678 flow. Second operand has 31 states, 31 states have (on average 25.032258064516128) internal successors, (776), 31 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:03,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:03,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:34:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:05,346 INFO L124 PetriNetUnfolderBase]: 976/2421 cut-off events. [2025-01-10 06:34:05,346 INFO L125 PetriNetUnfolderBase]: For 2776/2776 co-relation queries the response was YES. [2025-01-10 06:34:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6944 conditions, 2421 events. 976/2421 cut-off events. For 2776/2776 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12854 event pairs, 146 based on Foata normal form. 30/2341 useless extension candidates. Maximal degree in co-relation 5696. Up to 884 conditions per place. [2025-01-10 06:34:05,376 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 170 selfloop transitions, 29 changer transitions 6/224 dead transitions. [2025-01-10 06:34:05,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 224 transitions, 1342 flow [2025-01-10 06:34:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:34:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:34:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 701 transitions. [2025-01-10 06:34:05,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.522354694485842 [2025-01-10 06:34:05,378 INFO L175 Difference]: Start difference. First operand has 128 places, 103 transitions, 678 flow. Second operand 22 states and 701 transitions. [2025-01-10 06:34:05,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 224 transitions, 1342 flow [2025-01-10 06:34:05,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 224 transitions, 1294 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-01-10 06:34:05,398 INFO L231 Difference]: Finished difference. Result has 138 places, 94 transitions, 593 flow [2025-01-10 06:34:05,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=593, PETRI_PLACES=138, PETRI_TRANSITIONS=94} [2025-01-10 06:34:05,398 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 81 predicate places. [2025-01-10 06:34:05,399 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 94 transitions, 593 flow [2025-01-10 06:34:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 25.032258064516128) internal successors, (776), 31 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:05,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:05,399 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:05,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:34:05,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 06:34:05,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:34:05,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 149026781, now seen corresponding path program 2 times [2025-01-10 06:34:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130712021] [2025-01-10 06:34:05,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:05,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:34:05,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:34:05,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:34:05,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130712021] [2025-01-10 06:34:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130712021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610664273] [2025-01-10 06:34:06,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:06,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:06,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:34:06,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:34:06,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:34:06,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:34:06,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:06,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-01-10 06:34:06,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:06,803 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 29 treesize of output 1 [2025-01-10 06:34:06,877 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-01-10 06:34:06,877 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-01-10 06:34:06,930 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 43 treesize of output 23 [2025-01-10 06:34:07,007 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 43 treesize of output 23 [2025-01-10 06:34:07,067 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-01-10 06:34:07,068 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-01-10 06:34:07,117 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 43 treesize of output 23 [2025-01-10 06:34:07,196 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 43 treesize of output 23 [2025-01-10 06:34:07,260 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-01-10 06:34:07,260 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-01-10 06:34:07,310 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 43 treesize of output 23 [2025-01-10 06:34:07,392 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 43 treesize of output 23 [2025-01-10 06:34:07,440 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 31 treesize of output 23 [2025-01-10 06:34:07,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 23 [2025-01-10 06:34:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:07,445 INFO L312 TraceCheckSpWp]: Computing backward predicates...