./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.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/goblint-regression/04-mutex_46-escape_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b71c523f20411078d17c9943b891d34ddfc00131917c4009fb579cdffacef23c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:43:53,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:43:53,332 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:43:53,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:43:53,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:43:53,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:43:53,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:43:53,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:43:53,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:43:53,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:43:53,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:43:53,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:43:53,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:43:53,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:43:53,360 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:43:53,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:43:53,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:43:53,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:43:53,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:43:53,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:43:53,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:43:53,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:43:53,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:53,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:53,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:43:53,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:43:53,363 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 -> b71c523f20411078d17c9943b891d34ddfc00131917c4009fb579cdffacef23c [2025-01-10 06:43:53,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:43:53,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:43:53,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:43:53,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:43:53,595 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:43:53,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2025-01-10 06:43:54,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/439846bb2/da08b7fff9894130bfc9d49e66d7b2b2/FLAGacfda0ccc [2025-01-10 06:43:54,996 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:43:54,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2025-01-10 06:43:55,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/439846bb2/da08b7fff9894130bfc9d49e66d7b2b2/FLAGacfda0ccc [2025-01-10 06:43:55,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/439846bb2/da08b7fff9894130bfc9d49e66d7b2b2 [2025-01-10 06:43:55,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:43:55,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:43:55,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:43:55,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:43:55,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:43:55,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a00c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55, skipping insertion in model container [2025-01-10 06:43:55,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:43:55,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:43:55,581 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:43:55,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:43:55,658 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:43:55,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55 WrapperNode [2025-01-10 06:43:55,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:43:55,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:43:55,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:43:55,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:43:55,665 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:43:55" (1/1) ... [2025-01-10 06:43:55,674 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:43:55" (1/1) ... [2025-01-10 06:43:55,686 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2025-01-10 06:43:55,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:43:55,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:43:55,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:43:55,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:43:55,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,701 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [5, 6]. 55 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [5, 1]. The 2 writes are split as follows [0, 2]. [2025-01-10 06:43:55,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:43:55,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:43:55,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:43:55,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:43:55,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (1/1) ... [2025-01-10 06:43:55,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:55,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:43:55,736 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:43:55,738 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:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:43:55,755 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:43:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:43:55,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:43:55,756 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:43:55,852 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:43:55,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:43:56,010 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:43:56,010 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:43:56,278 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:43:56,278 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:43:56,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:56 BoogieIcfgContainer [2025-01-10 06:43:56,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:43:56,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:43:56,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:43:56,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:43:56,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:43:55" (1/3) ... [2025-01-10 06:43:56,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a09025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:43:56, skipping insertion in model container [2025-01-10 06:43:56,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:55" (2/3) ... [2025-01-10 06:43:56,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a09025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:43:56, skipping insertion in model container [2025-01-10 06:43:56,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:56" (3/3) ... [2025-01-10 06:43:56,287 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_46-escape_nr.i [2025-01-10 06:43:56,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:43:56,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_46-escape_nr.i that has 2 procedures, 26 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 06:43:56,299 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:43:56,333 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:43:56,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 59 flow [2025-01-10 06:43:56,380 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-01-10 06:43:56,382 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:43:56,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 25 events. 1/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 1. Up to 2 conditions per place. [2025-01-10 06:43:56,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 59 flow [2025-01-10 06:43:56,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 45 flow [2025-01-10 06:43:56,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:43:56,402 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;@28fc5b8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:43:56,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 06:43:56,410 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:43:56,411 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:43:56,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:56,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:56,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:56,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1717605375, now seen corresponding path program 1 times [2025-01-10 06:43:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:56,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100282339] [2025-01-10 06:43:56,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:56,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:43:56,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:43:56,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:56,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:56,780 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:43:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100282339] [2025-01-10 06:43:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100282339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:56,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702336798] [2025-01-10 06:43:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:56,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:43:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:56,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:43:56,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:43:56,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-01-10 06:43:56,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 45 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:43:56,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:56,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-01-10 06:43:56,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:56,934 INFO L124 PetriNetUnfolderBase]: 44/130 cut-off events. [2025-01-10 06:43:56,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:56,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 130 events. 44/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 470 event pairs, 16 based on Foata normal form. 7/124 useless extension candidates. Maximal degree in co-relation 231. Up to 43 conditions per place. [2025-01-10 06:43:56,937 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 20 selfloop transitions, 7 changer transitions 5/37 dead transitions. [2025-01-10 06:43:56,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 37 transitions, 141 flow [2025-01-10 06:43:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:43:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:43:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-01-10 06:43:56,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-01-10 06:43:56,946 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 45 flow. Second operand 6 states and 70 transitions. [2025-01-10 06:43:56,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 37 transitions, 141 flow [2025-01-10 06:43:56,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:43:56,951 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 84 flow [2025-01-10 06:43:56,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-01-10 06:43:56,955 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-01-10 06:43:56,956 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 84 flow [2025-01-10 06:43:56,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:43:56,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:56,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:43:56,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1716986721, now seen corresponding path program 1 times [2025-01-10 06:43:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412930319] [2025-01-10 06:43:56,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:57,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:43:57,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:43:57,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:57,139 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:43:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412930319] [2025-01-10 06:43:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412930319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:43:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662270656] [2025-01-10 06:43:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:43:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:57,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:43:57,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:43:57,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-01-10 06:43:57,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:43:57,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:57,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-01-10 06:43:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:57,304 INFO L124 PetriNetUnfolderBase]: 36/121 cut-off events. [2025-01-10 06:43:57,304 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 06:43:57,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 121 events. 36/121 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 460 event pairs, 7 based on Foata normal form. 6/127 useless extension candidates. Maximal degree in co-relation 266. Up to 37 conditions per place. [2025-01-10 06:43:57,305 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 21 selfloop transitions, 11 changer transitions 7/45 dead transitions. [2025-01-10 06:43:57,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 228 flow [2025-01-10 06:43:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:43:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:43:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-01-10 06:43:57,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-01-10 06:43:57,306 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 84 flow. Second operand 9 states and 93 transitions. [2025-01-10 06:43:57,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 228 flow [2025-01-10 06:43:57,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:43:57,308 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 150 flow [2025-01-10 06:43:57,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2025-01-10 06:43:57,308 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-01-10 06:43:57,308 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 150 flow [2025-01-10 06:43:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:43:57,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:57,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:43:57,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1686980492, now seen corresponding path program 1 times [2025-01-10 06:43:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397866254] [2025-01-10 06:43:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:43:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:43:57,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:57,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:57,468 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:43:57,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:57,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397866254] [2025-01-10 06:43:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397866254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:57,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:43:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611645693] [2025-01-10 06:43:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:57,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:43:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:57,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:43:57,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:43:57,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-01-10 06:43:57,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:43:57,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:57,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-01-10 06:43:57,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:57,624 INFO L124 PetriNetUnfolderBase]: 24/92 cut-off events. [2025-01-10 06:43:57,626 INFO L125 PetriNetUnfolderBase]: For 127/129 co-relation queries the response was YES. [2025-01-10 06:43:57,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 92 events. 24/92 cut-off events. For 127/129 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 330 event pairs, 4 based on Foata normal form. 8/100 useless extension candidates. Maximal degree in co-relation 241. Up to 40 conditions per place. [2025-01-10 06:43:57,629 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 21 selfloop transitions, 10 changer transitions 1/38 dead transitions. [2025-01-10 06:43:57,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 238 flow [2025-01-10 06:43:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:43:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:43:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-01-10 06:43:57,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3894230769230769 [2025-01-10 06:43:57,637 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 150 flow. Second operand 8 states and 81 transitions. [2025-01-10 06:43:57,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 238 flow [2025-01-10 06:43:57,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:43:57,642 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 148 flow [2025-01-10 06:43:57,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2025-01-10 06:43:57,644 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 23 predicate places. [2025-01-10 06:43:57,644 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 148 flow [2025-01-10 06:43:57,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:43:57,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:57,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:57,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:43:57,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1706158788, now seen corresponding path program 1 times [2025-01-10 06:43:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848417832] [2025-01-10 06:43:57,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:57,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:57,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:43:57,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:43:57,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:57,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:57,715 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:43:57,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:57,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848417832] [2025-01-10 06:43:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848417832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:57,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:57,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016493844] [2025-01-10 06:43:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:57,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:43:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:57,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:43:57,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:43:57,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-01-10 06:43:57,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:43:57,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:57,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-01-10 06:43:57,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:57,804 INFO L124 PetriNetUnfolderBase]: 26/92 cut-off events. [2025-01-10 06:43:57,804 INFO L125 PetriNetUnfolderBase]: For 178/180 co-relation queries the response was YES. [2025-01-10 06:43:57,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 92 events. 26/92 cut-off events. For 178/180 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 294 event pairs, 11 based on Foata normal form. 9/101 useless extension candidates. Maximal degree in co-relation 255. Up to 39 conditions per place. [2025-01-10 06:43:57,807 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 20 selfloop transitions, 7 changer transitions 2/34 dead transitions. [2025-01-10 06:43:57,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 34 transitions, 230 flow [2025-01-10 06:43:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:43:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:43:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-01-10 06:43:57,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-01-10 06:43:57,809 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 148 flow. Second operand 6 states and 66 transitions. [2025-01-10 06:43:57,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 34 transitions, 230 flow [2025-01-10 06:43:57,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 199 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-01-10 06:43:57,813 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 123 flow [2025-01-10 06:43:57,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2025-01-10 06:43:57,814 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-01-10 06:43:57,814 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 123 flow [2025-01-10 06:43:57,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:43:57,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:57,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:57,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:43:57,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:57,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1059734223, now seen corresponding path program 1 times [2025-01-10 06:43:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:57,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932304846] [2025-01-10 06:43:57,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:57,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:43:57,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:43:57,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:57,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:57,884 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:43:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:57,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932304846] [2025-01-10 06:43:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932304846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012631309] [2025-01-10 06:43:57,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:57,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:43:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:57,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:43:57,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:43:57,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-01-10 06:43:57,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 25 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:43:57,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:57,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-01-10 06:43:57,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:57,918 INFO L124 PetriNetUnfolderBase]: 12/57 cut-off events. [2025-01-10 06:43:57,919 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-10 06:43:57,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 57 events. 12/57 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 3 based on Foata normal form. 6/63 useless extension candidates. Maximal degree in co-relation 146. Up to 26 conditions per place. [2025-01-10 06:43:57,919 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 18 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-01-10 06:43:57,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 29 transitions, 181 flow [2025-01-10 06:43:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:43:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:43:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-10 06:43:57,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-01-10 06:43:57,924 INFO L175 Difference]: Start difference. First operand has 45 places, 25 transitions, 123 flow. Second operand 3 states and 43 transitions. [2025-01-10 06:43:57,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 29 transitions, 181 flow [2025-01-10 06:43:57,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 163 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 06:43:57,926 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 113 flow [2025-01-10 06:43:57,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2025-01-10 06:43:57,927 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-01-10 06:43:57,927 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 113 flow [2025-01-10 06:43:57,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:43:57,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:57,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:43:57,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1875612491, now seen corresponding path program 1 times [2025-01-10 06:43:57,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:57,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539803031] [2025-01-10 06:43:57,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:57,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:57,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:43:57,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:43:57,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:57,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:58,093 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:43:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539803031] [2025-01-10 06:43:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539803031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:43:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780671644] [2025-01-10 06:43:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:58,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:43:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:58,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:43:58,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:43:58,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-01-10 06:43:58,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:43:58,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:58,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-01-10 06:43:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:58,210 INFO L124 PetriNetUnfolderBase]: 14/56 cut-off events. [2025-01-10 06:43:58,210 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 06:43:58,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 56 events. 14/56 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 1 based on Foata normal form. 3/59 useless extension candidates. Maximal degree in co-relation 151. Up to 25 conditions per place. [2025-01-10 06:43:58,211 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 15 selfloop transitions, 13 changer transitions 0/30 dead transitions. [2025-01-10 06:43:58,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 30 transitions, 186 flow [2025-01-10 06:43:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:43:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:43:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2025-01-10 06:43:58,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24519230769230768 [2025-01-10 06:43:58,213 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 113 flow. Second operand 8 states and 51 transitions. [2025-01-10 06:43:58,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 30 transitions, 186 flow [2025-01-10 06:43:58,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:43:58,217 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 130 flow [2025-01-10 06:43:58,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2025-01-10 06:43:58,218 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-01-10 06:43:58,218 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 130 flow [2025-01-10 06:43:58,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:43:58,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:58,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:43:58,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 599472258, now seen corresponding path program 1 times [2025-01-10 06:43:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001707408] [2025-01-10 06:43:58,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:58,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:43:58,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:43:58,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:58,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:58,421 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:43:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:58,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001707408] [2025-01-10 06:43:58,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001707408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:43:58,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700988983] [2025-01-10 06:43:58,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:58,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:43:58,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:43:58,424 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:43:58,426 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:43:58,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:43:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:43:58,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:58,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:58,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:43:58,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:43:58,668 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 36 treesize of output 13 [2025-01-10 06:43:58,684 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 15 treesize of output 7 [2025-01-10 06:43:58,688 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:43:58,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:43:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700988983] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 06:43:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:43:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-01-10 06:43:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015014160] [2025-01-10 06:43:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:43:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:58,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:43:58,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:43:58,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-01-10 06:43:58,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 130 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:43:58,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:58,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-01-10 06:43:58,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:59,092 INFO L124 PetriNetUnfolderBase]: 12/61 cut-off events. [2025-01-10 06:43:59,092 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-10 06:43:59,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 61 events. 12/61 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 3 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 164. Up to 28 conditions per place. [2025-01-10 06:43:59,093 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 17 selfloop transitions, 9 changer transitions 6/35 dead transitions. [2025-01-10 06:43:59,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 35 transitions, 230 flow [2025-01-10 06:43:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:43:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:43:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2025-01-10 06:43:59,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27692307692307694 [2025-01-10 06:43:59,094 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 130 flow. Second operand 10 states and 72 transitions. [2025-01-10 06:43:59,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 35 transitions, 230 flow [2025-01-10 06:43:59,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 35 transitions, 219 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:43:59,098 INFO L231 Difference]: Finished difference. Result has 49 places, 24 transitions, 135 flow [2025-01-10 06:43:59,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=135, PETRI_PLACES=49, PETRI_TRANSITIONS=24} [2025-01-10 06:43:59,099 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 24 predicate places. [2025-01-10 06:43:59,099 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 24 transitions, 135 flow [2025-01-10 06:43:59,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:43:59,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:59,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:59,107 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:43:59,300 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:43:59,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:43:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash -365426080, now seen corresponding path program 1 times [2025-01-10 06:43:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109723186] [2025-01-10 06:43:59,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:59,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:59,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:43:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:43:59,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:59,514 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:43:59,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109723186] [2025-01-10 06:43:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109723186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:43:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694479277] [2025-01-10 06:43:59,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:43:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:43:59,517 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:43:59,518 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:43:59,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:43:59,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:43:59,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:59,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:59,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 06:43:59,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:43:59,711 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 36 treesize of output 13 [2025-01-10 06:43:59,722 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 15 treesize of output 7 [2025-01-10 06:43:59,725 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:43:59,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:43:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694479277] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 06:43:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:43:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-01-10 06:43:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14147733] [2025-01-10 06:43:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:59,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:43:59,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:59,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:43:59,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:43:59,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-01-10 06:43:59,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 24 transitions, 135 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:43:59,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:59,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-01-10 06:43:59,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:00,015 INFO L124 PetriNetUnfolderBase]: 11/50 cut-off events. [2025-01-10 06:44:00,015 INFO L125 PetriNetUnfolderBase]: For 85/87 co-relation queries the response was YES. [2025-01-10 06:44:00,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 50 events. 11/50 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 4 based on Foata normal form. 2/52 useless extension candidates. Maximal degree in co-relation 152. Up to 12 conditions per place. [2025-01-10 06:44:00,016 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 9 selfloop transitions, 5 changer transitions 11/28 dead transitions. [2025-01-10 06:44:00,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 28 transitions, 193 flow [2025-01-10 06:44:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:44:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:44:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2025-01-10 06:44:00,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27403846153846156 [2025-01-10 06:44:00,017 INFO L175 Difference]: Start difference. First operand has 49 places, 24 transitions, 135 flow. Second operand 8 states and 57 transitions. [2025-01-10 06:44:00,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 28 transitions, 193 flow [2025-01-10 06:44:00,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 169 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-10 06:44:00,019 INFO L231 Difference]: Finished difference. Result has 42 places, 17 transitions, 86 flow [2025-01-10 06:44:00,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=42, PETRI_TRANSITIONS=17} [2025-01-10 06:44:00,020 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-01-10 06:44:00,020 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 17 transitions, 86 flow [2025-01-10 06:44:00,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:44:00,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:00,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:00,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:44:00,220 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:44:00,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:44:00,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1243769580, now seen corresponding path program 2 times [2025-01-10 06:44:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929286990] [2025-01-10 06:44:00,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:00,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:44:00,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:44:00,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:44:00,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:00,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:00,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929286990] [2025-01-10 06:44:00,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929286990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455116483] [2025-01-10 06:44:00,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:00,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:00,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:00,435 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:44:00,437 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:44:00,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:44:00,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:44:00,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:44:00,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:00,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 06:44:00,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:00,672 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 36 treesize of output 13 [2025-01-10 06:44:00,696 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 15 treesize of output 7 [2025-01-10 06:44:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:00,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455116483] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:44:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2025-01-10 06:44:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966910240] [2025-01-10 06:44:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:00,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:44:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:00,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:44:00,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:44:00,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-01-10 06:44:00,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 17 transitions, 86 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:44:00,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:00,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-01-10 06:44:00,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:00,982 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-01-10 06:44:00,983 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-01-10 06:44:00,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 24 events. 1/24 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 1 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 62. Up to 9 conditions per place. [2025-01-10 06:44:00,983 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 7 selfloop transitions, 5 changer transitions 5/20 dead transitions. [2025-01-10 06:44:00,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 20 transitions, 131 flow [2025-01-10 06:44:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:44:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:44:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2025-01-10 06:44:00,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2025-01-10 06:44:00,985 INFO L175 Difference]: Start difference. First operand has 42 places, 17 transitions, 86 flow. Second operand 9 states and 54 transitions. [2025-01-10 06:44:00,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 20 transitions, 131 flow [2025-01-10 06:44:00,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 20 transitions, 93 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-01-10 06:44:00,986 INFO L231 Difference]: Finished difference. Result has 33 places, 15 transitions, 58 flow [2025-01-10 06:44:00,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=15} [2025-01-10 06:44:00,988 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-01-10 06:44:00,988 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 15 transitions, 58 flow [2025-01-10 06:44:00,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:44:00,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:00,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:00,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:44:01,192 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:44:01,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:44:01,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1889345194, now seen corresponding path program 3 times [2025-01-10 06:44:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:01,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88659940] [2025-01-10 06:44:01,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:44:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:01,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:44:01,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:44:01,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:44:01,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88659940] [2025-01-10 06:44:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88659940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110494109] [2025-01-10 06:44:01,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:44:01,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:01,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:01,326 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:44:01,328 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:44:01,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:44:01,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:44:01,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:44:01,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:01,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 06:44:01,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:01,518 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 36 treesize of output 13 [2025-01-10 06:44:01,553 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 15 treesize of output 7 [2025-01-10 06:44:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:01,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110494109] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:44:01,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-01-10 06:44:01,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154852806] [2025-01-10 06:44:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:01,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:44:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:01,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:44:01,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:44:01,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-01-10 06:44:01,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 15 transitions, 58 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:44:01,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:01,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-01-10 06:44:01,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:01,775 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-01-10 06:44:01,775 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:44:01,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 16 events. 1/16 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2025-01-10 06:44:01,775 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 0 selfloop transitions, 0 changer transitions 15/15 dead transitions. [2025-01-10 06:44:01,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 15 transitions, 80 flow [2025-01-10 06:44:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:44:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:44:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2025-01-10 06:44:01,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2094017094017094 [2025-01-10 06:44:01,776 INFO L175 Difference]: Start difference. First operand has 33 places, 15 transitions, 58 flow. Second operand 9 states and 49 transitions. [2025-01-10 06:44:01,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 15 transitions, 80 flow [2025-01-10 06:44:01,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 15 transitions, 66 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-01-10 06:44:01,776 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2025-01-10 06:44:01,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2025-01-10 06:44:01,777 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2025-01-10 06:44:01,777 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2025-01-10 06:44:01,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:44:01,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-01-10 06:44:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-01-10 06:44:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-10 06:44:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-01-10 06:44:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-01-10 06:44:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-01-10 06:44:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-01-10 06:44:01,786 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:44:01,981 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:44:01,981 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:01,985 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:44:01,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:44:01,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:44:01 BasicIcfg [2025-01-10 06:44:01,988 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:44:01,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:44:01,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:44:01,989 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:44:01,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:56" (3/4) ... [2025-01-10 06:44:01,991 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:44:01,993 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 06:44:01,995 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 87 nodes and edges [2025-01-10 06:44:01,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 06:44:01,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 06:44:01,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:44:02,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:44:02,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:44:02,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:44:02,048 INFO L158 Benchmark]: Toolchain (without parser) took 6762.40ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 122.6MB in the beginning and 292.4MB in the end (delta: -169.9MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,048 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:02,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.64ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 95.4MB in the end (delta: 27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.60ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 92.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,049 INFO L158 Benchmark]: Boogie Preprocessor took 24.81ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:02,050 INFO L158 Benchmark]: RCFGBuilder took 567.23ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 110.4MB in the end (delta: -19.0MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,050 INFO L158 Benchmark]: TraceAbstraction took 5707.25ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 109.5MB in the beginning and 296.2MB in the end (delta: -186.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,050 INFO L158 Benchmark]: Witness Printer took 57.60ms. Allocated memory is still 360.7MB. Free memory was 296.2MB in the beginning and 292.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:02,051 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.64ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 95.4MB in the end (delta: 27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.60ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 92.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.81ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 567.23ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 110.4MB in the end (delta: -19.0MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5707.25ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 109.5MB in the beginning and 296.2MB in the end (delta: -186.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 57.60ms. Allocated memory is still 360.7MB. Free memory was 296.2MB in the beginning and 292.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 936]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 936]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 924]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 924]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 37 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 368 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1003 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 18 mSDtfsCounter, 1003 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=2, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 205 ConstructedInterpolants, 16 QuantifiedInterpolants, 2100 SizeOfPredicates, 44 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 18/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:44:02,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE