./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65bafbd746f159f00b6ba50bd19d362fd9c690b638652ed8ef63e74bbc6bc5fd --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:51:56,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:51:56,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:51:56,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:51:56,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:51:56,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:51:56,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:51:56,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:51:56,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:51:56,525 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:51:56,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:51:56,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:51:56,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:51:56,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:51:56,526 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:51:56,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:51:56,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:51:56,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:51:56,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:51:56,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:51:56,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 65bafbd746f159f00b6ba50bd19d362fd9c690b638652ed8ef63e74bbc6bc5fd [2025-04-29 10:51:56,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:51:56,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:51:56,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:51:56,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:51:56,789 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:51:56,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.c [2025-04-29 10:51:58,185 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a62c257/1b95eb76a1c047e9bc4cd9a1da18e940/FLAG860f02257 [2025-04-29 10:51:58,396 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:51:58,398 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.c [2025-04-29 10:51:58,399 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:51:58,399 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:51:58,403 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a62c257/1b95eb76a1c047e9bc4cd9a1da18e940/FLAG860f02257 [2025-04-29 10:51:59,184 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a62c257/1b95eb76a1c047e9bc4cd9a1da18e940 [2025-04-29 10:51:59,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:51:59,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:51:59,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:51:59,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:51:59,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:51:59,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb912b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59, skipping insertion in model container [2025-04-29 10:51:59,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:51:59,330 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.c[399,412] [2025-04-29 10:51:59,348 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:51:59,357 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:51:59,372 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.c[399,412] [2025-04-29 10:51:59,379 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:51:59,395 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:51:59,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59 WrapperNode [2025-04-29 10:51:59,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:51:59,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:51:59,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:51:59,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:51:59,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,421 INFO L138 Inliner]: procedures = 14, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2025-04-29 10:51:59,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:51:59,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:51:59,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:51:59,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:51:59,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,439 INFO L175 MemorySlicer]: Split 3 memory accesses to 3 slices as follows [1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 1, 1]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 10:51:59,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:51:59,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:51:59,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:51:59,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:51:59,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (1/1) ... [2025-04-29 10:51:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:51:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:59,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:51:59,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-29 10:51:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 10:51:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:51:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:51:59,497 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 10:51:59,569 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:51:59,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:51:59,733 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:51:59,733 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:51:59,835 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:51:59,840 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:51:59,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:51:59 BoogieIcfgContainer [2025-04-29 10:51:59,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:51:59,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:51:59,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:51:59,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:51:59,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:51:59" (1/3) ... [2025-04-29 10:51:59,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3559a571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:51:59, skipping insertion in model container [2025-04-29 10:51:59,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:59" (2/3) ... [2025-04-29 10:51:59,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3559a571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:51:59, skipping insertion in model container [2025-04-29 10:51:59,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:51:59" (3/3) ... [2025-04-29 10:51:59,848 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.c [2025-04-29 10:51:59,860 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:51:59,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_29-multiple-protecting2-vesal_true.c that has 2 procedures, 48 locations, 49 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-29 10:51:59,861 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:51:59,898 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 10:51:59,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 107 flow [2025-04-29 10:51:59,958 INFO L116 PetriNetUnfolderBase]: 3/49 cut-off events. [2025-04-29 10:51:59,960 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:51:59,963 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 46 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-04-29 10:51:59,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 50 transitions, 107 flow [2025-04-29 10:51:59,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 79 flow [2025-04-29 10:51:59,973 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:51:59,980 INFO L340 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;@1b4df2a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:51:59,980 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-29 10:51:59,985 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:51:59,985 INFO L116 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-04-29 10:51:59,986 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:51:59,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:59,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:59,986 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:51:59,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 976912396, now seen corresponding path program 1 times [2025-04-29 10:51:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:59,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983012463] [2025-04-29 10:51:59,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 10:52:00,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 10:52:00,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:00,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:00,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983012463] [2025-04-29 10:52:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983012463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:00,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:00,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:52:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181981738] [2025-04-29 10:52:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:00,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:52:00,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:00,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:52:00,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:52:00,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-29 10:52:00,274 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-04-29 10:52:00,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:00,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-29 10:52:00,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:00,439 INFO L116 PetriNetUnfolderBase]: 132/344 cut-off events. [2025-04-29 10:52:00,439 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:00,440 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 1501 event pairs, 61 based on Foata normal form. 14/343 useless extension candidates. Maximal degree in co-relation 631. Up to 128 conditions per place. [2025-04-29 10:52:00,445 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 39 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2025-04-29 10:52:00,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 223 flow [2025-04-29 10:52:00,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:52:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:52:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-04-29 10:52:00,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-29 10:52:00,456 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 79 flow. Second operand 5 states and 125 transitions. [2025-04-29 10:52:00,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 223 flow [2025-04-29 10:52:00,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:00,461 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 138 flow [2025-04-29 10:52:00,464 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-04-29 10:52:00,466 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-04-29 10:52:00,466 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 138 flow [2025-04-29 10:52:00,467 INFO L486 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-04-29 10:52:00,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:00,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:00,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:52:00,467 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:52:00,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1784991104, now seen corresponding path program 1 times [2025-04-29 10:52:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:00,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333432312] [2025-04-29 10:52:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:00,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:52:00,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:52:00,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:00,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:00,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333432312] [2025-04-29 10:52:00,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333432312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:00,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:00,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:52:00,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745668269] [2025-04-29 10:52:00,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:00,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:52:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:00,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:52:00,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:52:00,597 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-29 10:52:00,597 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-04-29 10:52:00,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:00,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-29 10:52:00,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:00,715 INFO L116 PetriNetUnfolderBase]: 135/347 cut-off events. [2025-04-29 10:52:00,715 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-29 10:52:00,716 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 22. Compared 1563 event pairs, 34 based on Foata normal form. 10/356 useless extension candidates. Maximal degree in co-relation 789. Up to 184 conditions per place. [2025-04-29 10:52:00,718 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2025-04-29 10:52:00,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 336 flow [2025-04-29 10:52:00,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:52:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:52:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-04-29 10:52:00,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.484 [2025-04-29 10:52:00,720 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 138 flow. Second operand 5 states and 121 transitions. [2025-04-29 10:52:00,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 336 flow [2025-04-29 10:52:00,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:00,724 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 226 flow [2025-04-29 10:52:00,724 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-04-29 10:52:00,725 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-04-29 10:52:00,725 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 226 flow [2025-04-29 10:52:00,725 INFO L486 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-04-29 10:52:00,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:00,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:00,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:52:00,726 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:52:00,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1930204829, now seen corresponding path program 1 times [2025-04-29 10:52:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:00,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628582389] [2025-04-29 10:52:00,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:00,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 10:52:00,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 10:52:00,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:00,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:00,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628582389] [2025-04-29 10:52:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628582389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848302828] [2025-04-29 10:52:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:00,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:00,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:00,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:00,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-29 10:52:00,828 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-04-29 10:52:00,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:00,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-29 10:52:00,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:00,971 INFO L116 PetriNetUnfolderBase]: 131/343 cut-off events. [2025-04-29 10:52:00,971 INFO L117 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-04-29 10:52:00,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 343 events. 131/343 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1504 event pairs, 34 based on Foata normal form. 17/359 useless extension candidates. Maximal degree in co-relation 910. Up to 154 conditions per place. [2025-04-29 10:52:00,974 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 46 selfloop transitions, 10 changer transitions 1/66 dead transitions. [2025-04-29 10:52:00,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 399 flow [2025-04-29 10:52:00,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-04-29 10:52:00,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-04-29 10:52:00,976 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 226 flow. Second operand 6 states and 134 transitions. [2025-04-29 10:52:00,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 399 flow [2025-04-29 10:52:00,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:00,979 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 281 flow [2025-04-29 10:52:00,979 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-04-29 10:52:00,980 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-04-29 10:52:00,980 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 281 flow [2025-04-29 10:52:00,980 INFO L486 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-04-29 10:52:00,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:00,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:00,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:52:00,981 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:52:00,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1379513341, now seen corresponding path program 1 times [2025-04-29 10:52:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:00,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15024816] [2025-04-29 10:52:00,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:00,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:52:00,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:52:00,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:00,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:01,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15024816] [2025-04-29 10:52:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15024816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:52:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59456898] [2025-04-29 10:52:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:01,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:52:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:01,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:52:01,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:52:01,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-29 10:52:01,075 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-04-29 10:52:01,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:01,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-29 10:52:01,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:01,209 INFO L116 PetriNetUnfolderBase]: 126/317 cut-off events. [2025-04-29 10:52:01,209 INFO L117 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-04-29 10:52:01,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 317 events. 126/317 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1330 event pairs, 20 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 948. Up to 84 conditions per place. [2025-04-29 10:52:01,211 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 47 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2025-04-29 10:52:01,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 485 flow [2025-04-29 10:52:01,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:52:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:52:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2025-04-29 10:52:01,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43 [2025-04-29 10:52:01,212 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 281 flow. Second operand 8 states and 172 transitions. [2025-04-29 10:52:01,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 485 flow [2025-04-29 10:52:01,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 449 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-29 10:52:01,225 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 283 flow [2025-04-29 10:52:01,225 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-04-29 10:52:01,227 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-04-29 10:52:01,227 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 283 flow [2025-04-29 10:52:01,228 INFO L486 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-04-29 10:52:01,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:01,228 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-04-29 10:52:01,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:52:01,228 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:52:01,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1204689327, now seen corresponding path program 1 times [2025-04-29 10:52:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:01,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729985993] [2025-04-29 10:52:01,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:01,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:52:01,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:52:01,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:01,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:01,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729985993] [2025-04-29 10:52:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729985993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:01,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:01,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937715430] [2025-04-29 10:52:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:01,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:01,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:01,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:01,385 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-04-29 10:52:01,385 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-04-29 10:52:01,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:01,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-04-29 10:52:01,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:01,466 INFO L116 PetriNetUnfolderBase]: 53/187 cut-off events. [2025-04-29 10:52:01,467 INFO L117 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-04-29 10:52:01,467 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 673 event pairs, 16 based on Foata normal form. 19/203 useless extension candidates. Maximal degree in co-relation 517. Up to 77 conditions per place. [2025-04-29 10:52:01,468 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 29 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2025-04-29 10:52:01,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 359 flow [2025-04-29 10:52:01,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:52:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:52:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-29 10:52:01,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-04-29 10:52:01,469 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 283 flow. Second operand 4 states and 116 transitions. [2025-04-29 10:52:01,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 359 flow [2025-04-29 10:52:01,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 306 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-04-29 10:52:01,471 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 224 flow [2025-04-29 10:52:01,471 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-04-29 10:52:01,473 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-04-29 10:52:01,474 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 224 flow [2025-04-29 10:52:01,474 INFO L486 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-04-29 10:52:01,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:01,474 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-04-29 10:52:01,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:52:01,474 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:52:01,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash -471191243, now seen corresponding path program 1 times [2025-04-29 10:52:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:01,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105487552] [2025-04-29 10:52:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:01,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:52:01,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:52:01,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:01,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:01,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105487552] [2025-04-29 10:52:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105487552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:01,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:52:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749471462] [2025-04-29 10:52:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:01,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:52:01,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:01,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:52:01,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:52:01,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-04-29 10:52:01,684 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-04-29 10:52:01,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:01,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-04-29 10:52:01,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:01,753 INFO L116 PetriNetUnfolderBase]: 42/160 cut-off events. [2025-04-29 10:52:01,753 INFO L117 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-04-29 10:52:01,754 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 501 event pairs, 8 based on Foata normal form. 9/169 useless extension candidates. Maximal degree in co-relation 453. Up to 72 conditions per place. [2025-04-29 10:52:01,754 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-04-29 10:52:01,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 362 flow [2025-04-29 10:52:01,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:52:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:52:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-29 10:52:01,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-04-29 10:52:01,755 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 224 flow. Second operand 4 states and 111 transitions. [2025-04-29 10:52:01,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 362 flow [2025-04-29 10:52:01,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:01,757 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 231 flow [2025-04-29 10:52:01,757 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-04-29 10:52:01,757 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-04-29 10:52:01,757 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 231 flow [2025-04-29 10:52:01,757 INFO L486 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-04-29 10:52:01,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:01,758 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-04-29 10:52:01,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:52:01,758 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-29 10:52:01,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1932363186, now seen corresponding path program 1 times [2025-04-29 10:52:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:01,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335410081] [2025-04-29 10:52:01,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:52:01,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:52:01,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:01,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:01,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335410081] [2025-04-29 10:52:01,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335410081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:01,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410786817] [2025-04-29 10:52:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:01,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:01,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:01,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:01,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-29 10:52:01,866 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-04-29 10:52:01,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:01,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-29 10:52:01,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:01,939 INFO L116 PetriNetUnfolderBase]: 50/164 cut-off events. [2025-04-29 10:52:01,939 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-29 10:52:01,939 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 518 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-04-29 10:52:01,939 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2025-04-29 10:52:01,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 338 flow [2025-04-29 10:52:01,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-04-29 10:52:01,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-29 10:52:01,941 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 231 flow. Second operand 6 states and 120 transitions. [2025-04-29 10:52:01,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 338 flow [2025-04-29 10:52:01,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 10:52:01,942 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-04-29 10:52:01,942 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-04-29 10:52:01,943 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-04-29 10:52:01,943 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-04-29 10:52:01,943 INFO L486 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-04-29 10:52:01,945 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-29 10:52:01,945 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-29 10:52:01,945 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-29 10:52:01,945 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-29 10:52:01,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:52:01,945 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:01,948 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:52:01,948 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:52:01,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:52:01 BasicIcfg [2025-04-29 10:52:01,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:52:01,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:52:01,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:52:01,952 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:52:01,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:51:59" (3/4) ... [2025-04-29 10:52:01,954 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:52:01,956 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-04-29 10:52:01,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-04-29 10:52:01,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 10:52:01,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:52:02,014 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:52:02,015 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:52:02,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:52:02,016 INFO L158 Benchmark]: Toolchain (without parser) took 2829.17ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2025-04-29 10:52:02,016 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:02,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.19ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 90.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:52:02,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.60ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:02,017 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 87.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:02,017 INFO L158 Benchmark]: RCFGBuilder took 387.75ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 65.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 10:52:02,017 INFO L158 Benchmark]: TraceAbstraction took 2109.62ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 94.8MB in the end (delta: -30.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:02,018 INFO L158 Benchmark]: Witness Printer took 63.44ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:52:02,018 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.19ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 90.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.60ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 87.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 387.75ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 65.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2109.62ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 94.8MB in the end (delta: -30.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.44ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: 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: 11]: 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: 11]: 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, 65 edges, 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: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 22 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 10 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.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 602 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-04-29 10:52:02,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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