./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-nondet.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 591990a0070f9287f734f2988edce5e1b5a43791c74b5c6b7374ff93ddaa2267 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:43,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:43,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:57:43,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:43,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:43,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:43,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:43,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:43,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:43,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:43,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:43,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:43,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:43,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:43,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:43,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:43,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:43,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:43,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:43,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:43,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:43,335 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 -> 591990a0070f9287f734f2988edce5e1b5a43791c74b5c6b7374ff93ddaa2267 [2025-01-10 06:57:43,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:43,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:43,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:43,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:43,559 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:43,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-nondet.i [2025-01-10 06:57:44,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f3baa861/a3e9d6228baf47ae8add4a93cb186a5c/FLAGab70c42f9 [2025-01-10 06:57:45,024 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:45,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-nondet.i [2025-01-10 06:57:45,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f3baa861/a3e9d6228baf47ae8add4a93cb186a5c/FLAGab70c42f9 [2025-01-10 06:57:45,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f3baa861/a3e9d6228baf47ae8add4a93cb186a5c [2025-01-10 06:57:45,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:45,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:45,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:45,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:45,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:45,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5938ddd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45, skipping insertion in model container [2025-01-10 06:57:45,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:45,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:45,340 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:45,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:45,399 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:45,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45 WrapperNode [2025-01-10 06:57:45,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:45,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:45,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:45,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:45,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,424 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 58 [2025-01-10 06:57:45,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:45,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:45,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:45,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:45,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:57:45,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:45,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:45,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:45,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:45,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (1/1) ... [2025-01-10 06:57:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:45,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:45,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:57:45,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:57:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:45,507 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:57:45,588 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:45,590 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:45,681 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:45,682 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:45,751 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:45,752 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:45,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:45 BoogieIcfgContainer [2025-01-10 06:57:45,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:45,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:45,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:45,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:45,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:45" (1/3) ... [2025-01-10 06:57:45,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d0cda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:45, skipping insertion in model container [2025-01-10 06:57:45,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:45" (2/3) ... [2025-01-10 06:57:45,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d0cda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:45, skipping insertion in model container [2025-01-10 06:57:45,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:45" (3/3) ... [2025-01-10 06:57:45,760 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-nondet.i [2025-01-10 06:57:45,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:45,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-nondet.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-10 06:57:45,772 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:45,826 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:57:45,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 68 flow [2025-01-10 06:57:45,884 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 06:57:45,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:45,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-01-10 06:57:45,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 27 transitions, 68 flow [2025-01-10 06:57:45,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 55 flow [2025-01-10 06:57:45,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:45,915 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;@26fbf034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:45,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:57:45,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:45,926 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:57:45,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:45,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:45,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:57:45,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash 213438672, now seen corresponding path program 1 times [2025-01-10 06:57:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501815813] [2025-01-10 06:57:45,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:46,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:57:46,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:57:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:46,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:46,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:57:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501815813] [2025-01-10 06:57:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501815813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:46,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:46,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221142775] [2025-01-10 06:57:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:46,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:46,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:46,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:46,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:46,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:46,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:46,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:46,296 INFO L124 PetriNetUnfolderBase]: 82/192 cut-off events. [2025-01-10 06:57:46,296 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:57:46,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 192 events. 82/192 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 838 event pairs, 66 based on Foata normal form. 10/163 useless extension candidates. Maximal degree in co-relation 328. Up to 144 conditions per place. [2025-01-10 06:57:46,303 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-01-10 06:57:46,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 83 flow [2025-01-10 06:57:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-10 06:57:46,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-01-10 06:57:46,318 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 55 flow. Second operand 3 states and 43 transitions. [2025-01-10 06:57:46,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 83 flow [2025-01-10 06:57:46,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:46,324 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 50 flow [2025-01-10 06:57:46,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-01-10 06:57:46,330 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-01-10 06:57:46,332 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 50 flow [2025-01-10 06:57:46,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:46,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:57:46,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:46,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1973335526, now seen corresponding path program 1 times [2025-01-10 06:57:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146868314] [2025-01-10 06:57:46,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:46,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:57:46,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:57:46,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:46,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:46,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146868314] [2025-01-10 06:57:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146868314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:46,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:46,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757520867] [2025-01-10 06:57:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:46,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:46,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:46,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 06:57:46,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:46,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 06:57:46,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:46,450 INFO L124 PetriNetUnfolderBase]: 82/189 cut-off events. [2025-01-10 06:57:46,450 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:57:46,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 189 events. 82/189 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 801 event pairs, 66 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 344. Up to 144 conditions per place. [2025-01-10 06:57:46,456 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2025-01-10 06:57:46,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 78 flow [2025-01-10 06:57:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-01-10 06:57:46,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2025-01-10 06:57:46,457 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 3 states and 40 transitions. [2025-01-10 06:57:46,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 78 flow [2025-01-10 06:57:46,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 77 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:46,458 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 49 flow [2025-01-10 06:57:46,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-01-10 06:57:46,459 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-01-10 06:57:46,459 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 49 flow [2025-01-10 06:57:46,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:46,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:46,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:46,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1047011870, now seen corresponding path program 1 times [2025-01-10 06:57:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214365141] [2025-01-10 06:57:46,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:46,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:46,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214365141] [2025-01-10 06:57:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214365141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167185033] [2025-01-10 06:57:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:46,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:46,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:46,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:46,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:46,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:46,685 INFO L124 PetriNetUnfolderBase]: 72/157 cut-off events. [2025-01-10 06:57:46,691 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:57:46,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 157 events. 72/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 540 event pairs, 18 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 307. Up to 55 conditions per place. [2025-01-10 06:57:46,694 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 15 selfloop transitions, 3 changer transitions 13/36 dead transitions. [2025-01-10 06:57:46,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 144 flow [2025-01-10 06:57:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-01-10 06:57:46,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-01-10 06:57:46,699 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 49 flow. Second operand 5 states and 78 transitions. [2025-01-10 06:57:46,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 144 flow [2025-01-10 06:57:46,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:46,701 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 61 flow [2025-01-10 06:57:46,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2025-01-10 06:57:46,704 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-01-10 06:57:46,704 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 61 flow [2025-01-10 06:57:46,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:46,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:46,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:46,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1771357072, now seen corresponding path program 1 times [2025-01-10 06:57:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:46,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992832928] [2025-01-10 06:57:46,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:46,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:46,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:46,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:46,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992832928] [2025-01-10 06:57:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992832928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755955822] [2025-01-10 06:57:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:46,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:46,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:46,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:46,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:46,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:46,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:46,830 INFO L124 PetriNetUnfolderBase]: 50/121 cut-off events. [2025-01-10 06:57:46,831 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 06:57:46,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 121 events. 50/121 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 330 event pairs, 32 based on Foata normal form. 5/115 useless extension candidates. Maximal degree in co-relation 266. Up to 80 conditions per place. [2025-01-10 06:57:46,832 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 20 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-01-10 06:57:46,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 129 flow [2025-01-10 06:57:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-01-10 06:57:46,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-01-10 06:57:46,833 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 61 flow. Second operand 4 states and 61 transitions. [2025-01-10 06:57:46,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 129 flow [2025-01-10 06:57:46,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 115 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:46,835 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 73 flow [2025-01-10 06:57:46,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2025-01-10 06:57:46,835 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-01-10 06:57:46,836 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 73 flow [2025-01-10 06:57:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:46,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:46,836 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:46,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:57:46,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:46,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1764874149, now seen corresponding path program 1 times [2025-01-10 06:57:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770901924] [2025-01-10 06:57:46,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:46,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:46,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770901924] [2025-01-10 06:57:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770901924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123172056] [2025-01-10 06:57:46,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:46,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:46,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:57:46,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:47,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:47,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:47,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:47,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:47,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:47,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123172056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416970861] [2025-01-10 06:57:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:47,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:47,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:47,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:47,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:47,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:47,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:47,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:47,163 INFO L124 PetriNetUnfolderBase]: 45/111 cut-off events. [2025-01-10 06:57:47,164 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 06:57:47,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 111 events. 45/111 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 12 based on Foata normal form. 5/105 useless extension candidates. Maximal degree in co-relation 260. Up to 35 conditions per place. [2025-01-10 06:57:47,167 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 23 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-01-10 06:57:47,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 153 flow [2025-01-10 06:57:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-01-10 06:57:47,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2025-01-10 06:57:47,170 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 73 flow. Second operand 6 states and 83 transitions. [2025-01-10 06:57:47,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 153 flow [2025-01-10 06:57:47,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:47,171 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 77 flow [2025-01-10 06:57:47,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2025-01-10 06:57:47,172 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2025-01-10 06:57:47,172 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 77 flow [2025-01-10 06:57:47,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:47,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:47,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:47,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:57:47,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:47,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:47,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1123475987, now seen corresponding path program 1 times [2025-01-10 06:57:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703299299] [2025-01-10 06:57:47,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:47,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:47,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:47,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:47,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703299299] [2025-01-10 06:57:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703299299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412552382] [2025-01-10 06:57:47,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:47,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:47,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:47,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:47,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:57:47,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:47,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:47,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:47,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:47,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:47,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:47,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412552382] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:47,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551694138] [2025-01-10 06:57:47,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:47,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:47,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:47,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:47,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:47,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 77 flow. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:47,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:47,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:47,734 INFO L124 PetriNetUnfolderBase]: 75/186 cut-off events. [2025-01-10 06:57:47,734 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-01-10 06:57:47,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 186 events. 75/186 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 487 event pairs, 27 based on Foata normal form. 15/195 useless extension candidates. Maximal degree in co-relation 475. Up to 70 conditions per place. [2025-01-10 06:57:47,736 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 37 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2025-01-10 06:57:47,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 261 flow [2025-01-10 06:57:47,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2025-01-10 06:57:47,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-01-10 06:57:47,737 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 77 flow. Second operand 10 states and 139 transitions. [2025-01-10 06:57:47,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 261 flow [2025-01-10 06:57:47,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 235 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:47,738 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 121 flow [2025-01-10 06:57:47,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-01-10 06:57:47,739 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-01-10 06:57:47,739 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 121 flow [2025-01-10 06:57:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:47,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:47,739 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:47,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:57:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:47,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1592638782, now seen corresponding path program 2 times [2025-01-10 06:57:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981812917] [2025-01-10 06:57:47,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:47,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:57:47,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-01-10 06:57:47,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:47,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981812917] [2025-01-10 06:57:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981812917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234456678] [2025-01-10 06:57:48,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:48,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:48,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:57:48,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:57:48,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-01-10 06:57:48,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:48,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:48,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:57:48,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:48,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234456678] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:48,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:57:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886107216] [2025-01-10 06:57:48,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:57:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:48,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:57:48,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:57:48,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-01-10 06:57:48,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 121 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:48,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:48,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-01-10 06:57:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:48,392 INFO L124 PetriNetUnfolderBase]: 134/326 cut-off events. [2025-01-10 06:57:48,393 INFO L125 PetriNetUnfolderBase]: For 412/412 co-relation queries the response was YES. [2025-01-10 06:57:48,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 326 events. 134/326 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1158 event pairs, 18 based on Foata normal form. 10/331 useless extension candidates. Maximal degree in co-relation 874. Up to 55 conditions per place. [2025-01-10 06:57:48,394 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-01-10 06:57:48,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 328 flow [2025-01-10 06:57:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:57:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:57:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2025-01-10 06:57:48,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-01-10 06:57:48,395 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 121 flow. Second operand 8 states and 70 transitions. [2025-01-10 06:57:48,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 328 flow [2025-01-10 06:57:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 288 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 06:57:48,398 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-01-10 06:57:48,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-01-10 06:57:48,399 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-01-10 06:57:48,399 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-01-10 06:57:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:48,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:57:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 06:57:48,410 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:57:48,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:48,607 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 06:57:48,611 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:57:48,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:57:48,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:57:48 BasicIcfg [2025-01-10 06:57:48,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:57:48,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:57:48,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:57:48,615 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:57:48,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:45" (3/4) ... [2025-01-10 06:57:48,616 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:57:48,618 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f1 [2025-01-10 06:57:48,618 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f2 [2025-01-10 06:57:48,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-10 06:57:48,630 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 06:57:48,631 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 06:57:48,631 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:57:48,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:57:48,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:57:48,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:57:48,687 INFO L158 Benchmark]: Toolchain (without parser) took 3610.51ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 89.3MB in the end (delta: 21.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-01-10 06:57:48,688 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:48,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.26ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 90.4MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:57:48,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.88ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:57:48,688 INFO L158 Benchmark]: Boogie Preprocessor took 21.64ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 86.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:48,688 INFO L158 Benchmark]: RCFGBuilder took 304.92ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 66.2MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:57:48,693 INFO L158 Benchmark]: TraceAbstraction took 2860.53ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 94.4MB in the end (delta: -28.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:48,693 INFO L158 Benchmark]: Witness Printer took 72.23ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 89.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:48,694 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.26ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 90.4MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.88ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.64ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 86.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.92ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 66.2MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2860.53ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 94.4MB in the end (delta: -28.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.23ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 89.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 760]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 760]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 10 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: 2.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558 IncrementalHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 21 mSDtfsCounter, 558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 409 SizeOfPredicates, 9 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 68/103 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:57:48,709 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