./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:33:34,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:33:34,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:33:34,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:33:34,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:33:34,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:33:34,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:33:34,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:33:34,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:33:34,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:33:34,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:33:34,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:33:34,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:33:34,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:33:34,392 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:33:34,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:33:34,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:33:34,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:33:34,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:33:34,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:33:34,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:34,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:34,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:34,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:33:34,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:33:34,398 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 ! call(reach_error())) ) 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 -> a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436 [2025-01-09 16:33:34,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:33:34,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:33:34,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:33:34,723 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:33:34,724 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:33:34,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-01-09 16:33:35,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62c21b0ea/76b20f5a3c34437abb23e1c90ecd8963/FLAGf2114c6d4 [2025-01-09 16:33:36,159 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:33:36,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-01-09 16:33:36,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62c21b0ea/76b20f5a3c34437abb23e1c90ecd8963/FLAGf2114c6d4 [2025-01-09 16:33:36,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62c21b0ea/76b20f5a3c34437abb23e1c90ecd8963 [2025-01-09 16:33:36,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:33:36,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:33:36,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:33:36,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:33:36,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:33:36,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd58d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36, skipping insertion in model container [2025-01-09 16:33:36,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:33:36,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-01-09 16:33:36,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:33:36,706 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:33:36,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-01-09 16:33:36,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:33:36,769 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:33:36,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36 WrapperNode [2025-01-09 16:33:36,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:33:36,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:33:36,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:33:36,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:33:36,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,797 INFO L138 Inliner]: procedures = 162, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-01-09 16:33:36,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:33:36,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:33:36,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:33:36,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:33:36,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,814 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 16:33:36,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:33:36,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:33:36,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:33:36,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:33:36,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (1/1) ... [2025-01-09 16:33:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:33:36,862 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-09 16:33:36,870 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-09 16:33:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-09 16:33:36,885 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-09 16:33:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:33:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:33:36,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:33:36,887 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:33:36,975 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:33:36,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:33:37,094 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:33:37,095 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:33:37,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:33:37,177 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:33:37,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:37 BoogieIcfgContainer [2025-01-09 16:33:37,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:33:37,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:33:37,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:33:37,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:33:37,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:36" (1/3) ... [2025-01-09 16:33:37,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b139d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:37, skipping insertion in model container [2025-01-09 16:33:37,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:36" (2/3) ... [2025-01-09 16:33:37,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b139d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:37, skipping insertion in model container [2025-01-09 16:33:37,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:37" (3/3) ... [2025-01-09 16:33:37,184 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2025-01-09 16:33:37,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:33:37,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_29-multiple-protecting2-vesal_true.i that has 2 procedures, 48 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-09 16:33:37,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:33:37,230 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:33:37,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 107 flow [2025-01-09 16:33:37,283 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2025-01-09 16:33:37,285 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:33:37,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 49 events. 3/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-01-09 16:33:37,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 50 transitions, 107 flow [2025-01-09 16:33:37,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 79 flow [2025-01-09 16:33:37,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:33:37,309 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;@191ccd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:33:37,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:33:37,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:33:37,317 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-01-09 16:33:37,317 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:33:37,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:37,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:37,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:37,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1639432612, now seen corresponding path program 1 times [2025-01-09 16:33:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:37,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669290349] [2025-01-09 16:33:37,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:33:37,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:33:37,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:37,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:37,593 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-09 16:33:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669290349] [2025-01-09 16:33:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669290349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:37,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:33:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604017465] [2025-01-09 16:33:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:37,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:33:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:37,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:33:37,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:33:37,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-09 16:33:37,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-09 16:33:37,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:37,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-09 16:33:37,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:37,764 INFO L124 PetriNetUnfolderBase]: 132/344 cut-off events. [2025-01-09 16:33:37,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:33:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 344 events. 132/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1533 event pairs, 61 based on Foata normal form. 14/342 useless extension candidates. Maximal degree in co-relation 631. Up to 128 conditions per place. [2025-01-09 16:33:37,767 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 39 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2025-01-09 16:33:37,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 223 flow [2025-01-09 16:33:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:33:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:33:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-01-09 16:33:37,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:33:37,777 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 79 flow. Second operand 5 states and 125 transitions. [2025-01-09 16:33:37,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 223 flow [2025-01-09 16:33:37,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:33:37,782 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 138 flow [2025-01-09 16:33:37,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-01-09 16:33:37,785 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-01-09 16:33:37,786 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 138 flow [2025-01-09 16:33:37,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-09 16:33:37,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:37,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:37,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:33:37,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:37,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash 758333671, now seen corresponding path program 1 times [2025-01-09 16:33:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-01-09 16:33:37,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:37,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:33:37,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:33:37,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:37,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:37,878 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-09 16:33:37,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:37,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-01-09 16:33:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181828020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:37,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:33:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512758814] [2025-01-09 16:33:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:37,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:33:37,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:37,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:33:37,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:33:37,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-09 16:33:37,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-09 16:33:37,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:37,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-09 16:33:37,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:37,980 INFO L124 PetriNetUnfolderBase]: 135/347 cut-off events. [2025-01-09 16:33:37,981 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-01-09 16:33:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 347 events. 135/347 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1573 event pairs, 34 based on Foata normal form. 10/355 useless extension candidates. Maximal degree in co-relation 789. Up to 184 conditions per place. [2025-01-09 16:33:37,983 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2025-01-09 16:33:37,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 336 flow [2025-01-09 16:33:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:33:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:33:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-01-09 16:33:37,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484 [2025-01-09 16:33:37,985 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 138 flow. Second operand 5 states and 121 transitions. [2025-01-09 16:33:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 336 flow [2025-01-09 16:33:37,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:33:37,987 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 226 flow [2025-01-09 16:33:37,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-01-09 16:33:37,988 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-01-09 16:33:37,988 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 226 flow [2025-01-09 16:33:37,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-09 16:33:37,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:37,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:37,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:33:37,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:37,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1363142688, now seen corresponding path program 1 times [2025-01-09 16:33:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495179703] [2025-01-09 16:33:37,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:37,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:33:38,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:33:38,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:38,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:38,069 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-09 16:33:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:38,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495179703] [2025-01-09 16:33:38,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495179703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:33:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982544375] [2025-01-09 16:33:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:38,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:33:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:38,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:33:38,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:33:38,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-09 16:33:38,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-09 16:33:38,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:38,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-09 16:33:38,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:38,206 INFO L124 PetriNetUnfolderBase]: 131/348 cut-off events. [2025-01-09 16:33:38,206 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-01-09 16:33:38,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 348 events. 131/348 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1516 event pairs, 36 based on Foata normal form. 17/363 useless extension candidates. Maximal degree in co-relation 915. Up to 154 conditions per place. [2025-01-09 16:33:38,209 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 46 selfloop transitions, 10 changer transitions 1/66 dead transitions. [2025-01-09 16:33:38,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 399 flow [2025-01-09 16:33:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:33:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:33:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-01-09 16:33:38,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-01-09 16:33:38,210 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 226 flow. Second operand 6 states and 134 transitions. [2025-01-09 16:33:38,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 399 flow [2025-01-09 16:33:38,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:33:38,213 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 281 flow [2025-01-09 16:33:38,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2025-01-09 16:33:38,214 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-01-09 16:33:38,214 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 281 flow [2025-01-09 16:33:38,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-09 16:33:38,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:38,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:38,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:33:38,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:38,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:38,215 INFO L85 PathProgramCache]: Analyzing trace with hash -794936313, now seen corresponding path program 1 times [2025-01-09 16:33:38,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:38,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-01-09 16:33:38,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:38,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:33:38,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:33:38,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:38,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:38,315 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-09 16:33:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:38,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-01-09 16:33:38,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894943284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:38,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:33:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150149786] [2025-01-09 16:33:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:38,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:33:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:38,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:33:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:33:38,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-09 16:33:38,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:38,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:38,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-09 16:33:38,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:38,440 INFO L124 PetriNetUnfolderBase]: 126/320 cut-off events. [2025-01-09 16:33:38,440 INFO L125 PetriNetUnfolderBase]: For 585/585 co-relation queries the response was YES. [2025-01-09 16:33:38,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 320 events. 126/320 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1349 event pairs, 18 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 951. Up to 84 conditions per place. [2025-01-09 16:33:38,442 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 47 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2025-01-09 16:33:38,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 485 flow [2025-01-09 16:33:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:33:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:33:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2025-01-09 16:33:38,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43 [2025-01-09 16:33:38,443 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 281 flow. Second operand 8 states and 172 transitions. [2025-01-09 16:33:38,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 485 flow [2025-01-09 16:33:38,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 449 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-09 16:33:38,447 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 283 flow [2025-01-09 16:33:38,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-01-09 16:33:38,448 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-01-09 16:33:38,448 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 283 flow [2025-01-09 16:33:38,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:38,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:38,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:33:38,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:38,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1680805028, now seen corresponding path program 1 times [2025-01-09 16:33:38,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:38,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410172235] [2025-01-09 16:33:38,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:38,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:33:38,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:33:38,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:38,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:38,552 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-09 16:33:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410172235] [2025-01-09 16:33:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410172235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:38,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:38,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:33:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500149430] [2025-01-09 16:33:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:38,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:33:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:38,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:33:38,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:33:38,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:33:38,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:38,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:38,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:33:38,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:38,630 INFO L124 PetriNetUnfolderBase]: 53/187 cut-off events. [2025-01-09 16:33:38,630 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-01-09 16:33:38,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 187 events. 53/187 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 676 event pairs, 16 based on Foata normal form. 19/202 useless extension candidates. Maximal degree in co-relation 517. Up to 77 conditions per place. [2025-01-09 16:33:38,631 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 29 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2025-01-09 16:33:38,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 359 flow [2025-01-09 16:33:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:33:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:33:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-01-09 16:33:38,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-01-09 16:33:38,633 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 283 flow. Second operand 4 states and 116 transitions. [2025-01-09 16:33:38,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 359 flow [2025-01-09 16:33:38,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 306 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-09 16:33:38,635 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 224 flow [2025-01-09 16:33:38,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-01-09 16:33:38,635 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-01-09 16:33:38,635 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 224 flow [2025-01-09 16:33:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:38,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:38,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:38,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:33:38,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:38,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -834053480, now seen corresponding path program 1 times [2025-01-09 16:33:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:38,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11234829] [2025-01-09 16:33:38,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:38,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:33:38,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:33:38,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:38,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:38,758 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-09 16:33:38,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:38,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11234829] [2025-01-09 16:33:38,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11234829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:38,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:38,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:33:38,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806687746] [2025-01-09 16:33:38,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:38,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:33:38,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:38,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:33:38,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:33:38,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:33:38,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:38,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:38,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:33:38,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:38,816 INFO L124 PetriNetUnfolderBase]: 42/160 cut-off events. [2025-01-09 16:33:38,816 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-01-09 16:33:38,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 160 events. 42/160 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 504 event pairs, 8 based on Foata normal form. 9/168 useless extension candidates. Maximal degree in co-relation 453. Up to 72 conditions per place. [2025-01-09 16:33:38,817 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-01-09 16:33:38,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 362 flow [2025-01-09 16:33:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:33:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:33:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-01-09 16:33:38,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-01-09 16:33:38,818 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 224 flow. Second operand 4 states and 111 transitions. [2025-01-09 16:33:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 362 flow [2025-01-09 16:33:38,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:33:38,820 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 231 flow [2025-01-09 16:33:38,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-01-09 16:33:38,821 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-01-09 16:33:38,821 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 231 flow [2025-01-09 16:33:38,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:38,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:38,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:38,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:33:38,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:33:38,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash 127158303, now seen corresponding path program 1 times [2025-01-09 16:33:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:38,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519609795] [2025-01-09 16:33:38,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:38,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:38,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:33:38,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:33:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:38,923 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-09 16:33:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519609795] [2025-01-09 16:33:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519609795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:33:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969618982] [2025-01-09 16:33:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:38,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:33:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:38,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:33:38,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:33:38,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-09 16:33:38,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-09 16:33:38,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:38,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-09 16:33:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:39,014 INFO L124 PetriNetUnfolderBase]: 50/164 cut-off events. [2025-01-09 16:33:39,015 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-01-09 16:33:39,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 164 events. 50/164 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 526 event pairs, 21 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 526. Up to 75 conditions per place. [2025-01-09 16:33:39,015 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2025-01-09 16:33:39,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 338 flow [2025-01-09 16:33:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:33:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:33:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-01-09 16:33:39,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-09 16:33:39,016 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 231 flow. Second operand 6 states and 120 transitions. [2025-01-09 16:33:39,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 338 flow [2025-01-09 16:33:39,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:33:39,018 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-01-09 16:33:39,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-01-09 16:33:39,018 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-01-09 16:33:39,018 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-01-09 16:33:39,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-09 16:33:39,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:33:39,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:33:39,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:33:39,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-09 16:33:39,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:33:39,021 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:39,023 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:33:39,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:33:39,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:33:39 BasicIcfg [2025-01-09 16:33:39,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:33:39,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:33:39,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:33:39,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:33:39,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:37" (3/4) ... [2025-01-09 16:33:39,029 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:33:39,031 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-01-09 16:33:39,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-01-09 16:33:39,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 16:33:39,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 16:33:39,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 16:33:39,078 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:33:39,078 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:33:39,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:33:39,079 INFO L158 Benchmark]: Toolchain (without parser) took 2644.59ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:33:39,079 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:33:39,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.10ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 101.0MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:33:39,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.78ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:33:39,079 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:33:39,080 INFO L158 Benchmark]: RCFGBuilder took 350.21ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 64.9MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:33:39,080 INFO L158 Benchmark]: TraceAbstraction took 1847.65ms. Allocated memory is still 167.8MB. Free memory was 64.5MB in the beginning and 124.0MB in the end (delta: -59.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:33:39,080 INFO L158 Benchmark]: Witness Printer took 51.13ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 118.8MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:33:39,081 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.10ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 101.0MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.78ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.21ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 64.9MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1847.65ms. Allocated memory is still 167.8MB. Free memory was 64.5MB in the beginning and 124.0MB in the end (delta: -59.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.13ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 118.8MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 63 locations, 4 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: 1.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 21 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=4, InterpolantAutomatonStates: 38, 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, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 16:33:39,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE