./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_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_01-priv_nr_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 e4b633f518697e1629a4783908b5111a4ab34de5cf9d8ef7b61ef08c4d5ab8ee --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:51:42,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:51:42,727 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:42,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:51:42,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:51:42,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:51:42,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:51:42,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:51:42,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:51:42,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:51:42,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:51:42,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:51:42,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:51:42,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:51:42,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:51:42,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:51:42,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:51:42,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:51:42,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:51:42,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:51:42,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:51:42,754 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 -> e4b633f518697e1629a4783908b5111a4ab34de5cf9d8ef7b61ef08c4d5ab8ee [2025-04-29 10:51:42,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:51:42,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:51:42,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:51:42,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:51:42,949 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:51:42,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.c [2025-04-29 10:51:44,207 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c384f3994/1fadb5e85a01432593643e704d36ba83/FLAG5235cceda [2025-04-29 10:51:44,385 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:51:44,386 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.c [2025-04-29 10:51:44,387 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:44,388 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:44,394 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c384f3994/1fadb5e85a01432593643e704d36ba83/FLAG5235cceda [2025-04-29 10:51:45,258 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c384f3994/1fadb5e85a01432593643e704d36ba83 [2025-04-29 10:51:45,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:51:45,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:51:45,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:51:45,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:51:45,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:51:45,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:51:45" (1/1) ... [2025-04-29 10:51:45,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42584471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:45, skipping insertion in model container [2025-04-29 10:51:45,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:51:45" (1/1) ... [2025-04-29 10:51:45,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:51:45,411 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_01-priv_nr_true.c[399,412] [2025-04-29 10:51:45,429 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:51:45,439 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:51:45,455 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_01-priv_nr_true.c[399,412] [2025-04-29 10:51:45,465 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:51:45,478 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:51:45,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:45 WrapperNode [2025-04-29 10:51:45,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:51:45,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:51:45,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:51:45,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:51:45,485 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:45" (1/1) ... [2025-04-29 10:51:45,490 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:45" (1/1) ... [2025-04-29 10:51:45,507 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 68 [2025-04-29 10:51:45,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:51:45,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:51:45,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:51:45,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:51:45,513 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:45" (1/1) ... [2025-04-29 10:51:45,513 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:45" (1/1) ... [2025-04-29 10:51:45,514 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:45" (1/1) ... [2025-04-29 10:51:45,523 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-04-29 10:51:45,524 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:45" (1/1) ... [2025-04-29 10:51:45,524 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:45" (1/1) ... [2025-04-29 10:51:45,531 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:45" (1/1) ... [2025-04-29 10:51:45,531 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:45" (1/1) ... [2025-04-29 10:51:45,533 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:45" (1/1) ... [2025-04-29 10:51:45,533 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:45" (1/1) ... [2025-04-29 10:51:45,534 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:45" (1/1) ... [2025-04-29 10:51:45,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:51:45,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:51:45,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:51:45,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:51:45,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:45" (1/1) ... [2025-04-29 10:51:45,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:51:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:45,566 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:45,569 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:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 10:51:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 10:51:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 10:51:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 10:51:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:51:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:51:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 10:51:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 10:51:45,585 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:45,638 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:51:45,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:51:45,733 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:51:45,734 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:51:45,791 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:51:45,791 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:51:45,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:51:45 BoogieIcfgContainer [2025-04-29 10:51:45,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:51:45,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:51:45,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:51:45,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:51:45,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:51:45" (1/3) ... [2025-04-29 10:51:45,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3a0dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:51:45, skipping insertion in model container [2025-04-29 10:51:45,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:51:45" (2/3) ... [2025-04-29 10:51:45,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3a0dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:51:45, skipping insertion in model container [2025-04-29 10:51:45,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:51:45" (3/3) ... [2025-04-29 10:51:45,798 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_01-priv_nr_true.c [2025-04-29 10:51:45,807 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:51:45,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_01-priv_nr_true.c that has 2 procedures, 32 locations, 34 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 10:51:45,808 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:51:45,837 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 10:51:45,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 77 flow [2025-04-29 10:51:45,877 INFO L116 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-04-29 10:51:45,878 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:51:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 34 events. 4/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-29 10:51:45,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 35 transitions, 77 flow [2025-04-29 10:51:45,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 32 transitions, 67 flow [2025-04-29 10:51:45,891 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:51:45,902 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;@606df0f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:51:45,903 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 10:51:45,905 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:51:45,905 INFO L116 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-04-29 10:51:45,905 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:51:45,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:45,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 10:51:45,907 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 10:51:45,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:45,911 INFO L85 PathProgramCache]: Analyzing trace with hash 222738, now seen corresponding path program 1 times [2025-04-29 10:51:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:45,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601762461] [2025-04-29 10:51:45,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:45,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 10:51:45,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 10:51:45,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:45,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:46,053 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:51:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:46,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601762461] [2025-04-29 10:51:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601762461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:51:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594155377] [2025-04-29 10:51:46,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:46,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:51:46,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:46,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:51:46,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:51:46,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-04-29 10:51:46,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:46,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:51:46,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-04-29 10:51:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:51:46,163 INFO L116 PetriNetUnfolderBase]: 49/146 cut-off events. [2025-04-29 10:51:46,164 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:51:46,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 146 events. 49/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 563 event pairs, 42 based on Foata normal form. 22/152 useless extension candidates. Maximal degree in co-relation 254. Up to 100 conditions per place. [2025-04-29 10:51:46,167 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 18 selfloop transitions, 4 changer transitions 3/33 dead transitions. [2025-04-29 10:51:46,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 119 flow [2025-04-29 10:51:46,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:51:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:51:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-29 10:51:46,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-04-29 10:51:46,176 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 67 flow. Second operand 3 states and 61 transitions. [2025-04-29 10:51:46,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 119 flow [2025-04-29 10:51:46,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:51:46,181 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 62 flow [2025-04-29 10:51:46,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-04-29 10:51:46,184 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-04-29 10:51:46,184 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 62 flow [2025-04-29 10:51:46,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:46,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:46,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:46,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:51:46,185 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 10:51:46,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:46,186 INFO L85 PathProgramCache]: Analyzing trace with hash -813089826, now seen corresponding path program 1 times [2025-04-29 10:51:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:46,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911562268] [2025-04-29 10:51:46,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:46,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 10:51:46,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 10:51:46,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:46,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:46,294 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:51:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:46,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911562268] [2025-04-29 10:51:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911562268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:46,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:51:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818318130] [2025-04-29 10:51:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:46,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:51:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:46,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:51:46,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:51:46,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-04-29 10:51:46,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:51:46,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:51:46,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-04-29 10:51:46,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:51:46,384 INFO L116 PetriNetUnfolderBase]: 49/151 cut-off events. [2025-04-29 10:51:46,384 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 10:51:46,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 151 events. 49/151 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 585 event pairs, 15 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 280. Up to 59 conditions per place. [2025-04-29 10:51:46,386 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 26 selfloop transitions, 7 changer transitions 2/41 dead transitions. [2025-04-29 10:51:46,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 164 flow [2025-04-29 10:51:46,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:51:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:51:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-04-29 10:51:46,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2025-04-29 10:51:46,388 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 62 flow. Second operand 5 states and 88 transitions. [2025-04-29 10:51:46,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 164 flow [2025-04-29 10:51:46,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 10:51:46,390 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 102 flow [2025-04-29 10:51:46,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-04-29 10:51:46,391 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2025-04-29 10:51:46,391 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 102 flow [2025-04-29 10:51:46,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:51:46,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:46,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:46,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:51:46,392 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 10:51:46,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash -845265233, now seen corresponding path program 1 times [2025-04-29 10:51:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:46,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010807677] [2025-04-29 10:51:46,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:46,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 10:51:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 10:51:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:46,473 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:51:46,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:46,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010807677] [2025-04-29 10:51:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010807677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:51:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397223701] [2025-04-29 10:51:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:46,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:51:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:46,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:51:46,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:51:46,483 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-04-29 10:51:46,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:46,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:51:46,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-04-29 10:51:46,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:51:46,568 INFO L116 PetriNetUnfolderBase]: 51/145 cut-off events. [2025-04-29 10:51:46,568 INFO L117 PetriNetUnfolderBase]: For 69/70 co-relation queries the response was YES. [2025-04-29 10:51:46,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 145 events. 51/145 cut-off events. For 69/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 526 event pairs, 20 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 328. Up to 69 conditions per place. [2025-04-29 10:51:46,569 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 22 selfloop transitions, 5 changer transitions 7/41 dead transitions. [2025-04-29 10:51:46,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 202 flow [2025-04-29 10:51:46,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:51:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:51:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-29 10:51:46,570 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-04-29 10:51:46,570 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 102 flow. Second operand 5 states and 84 transitions. [2025-04-29 10:51:46,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 202 flow [2025-04-29 10:51:46,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:51:46,572 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 108 flow [2025-04-29 10:51:46,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-04-29 10:51:46,573 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-04-29 10:51:46,573 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 108 flow [2025-04-29 10:51:46,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:46,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:46,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:46,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:51:46,573 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 10:51:46,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -195718986, now seen corresponding path program 1 times [2025-04-29 10:51:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:46,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435603153] [2025-04-29 10:51:46,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:46,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 10:51:46,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 10:51:46,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:46,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:46,626 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:51:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:46,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435603153] [2025-04-29 10:51:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435603153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:51:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715977085] [2025-04-29 10:51:46,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:46,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:51:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:46,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:51:46,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:51:46,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-29 10:51:46,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:51:46,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:51:46,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-29 10:51:46,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:51:46,656 INFO L116 PetriNetUnfolderBase]: 13/61 cut-off events. [2025-04-29 10:51:46,656 INFO L117 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-04-29 10:51:46,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 61 events. 13/61 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 4 based on Foata normal form. 7/68 useless extension candidates. Maximal degree in co-relation 135. Up to 29 conditions per place. [2025-04-29 10:51:46,656 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 16 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2025-04-29 10:51:46,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 154 flow [2025-04-29 10:51:46,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:51:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:51:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-29 10:51:46,657 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-04-29 10:51:46,657 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 108 flow. Second operand 3 states and 62 transitions. [2025-04-29 10:51:46,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 154 flow [2025-04-29 10:51:46,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 140 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-29 10:51:46,658 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 98 flow [2025-04-29 10:51:46,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2025-04-29 10:51:46,659 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2025-04-29 10:51:46,659 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 98 flow [2025-04-29 10:51:46,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:51:46,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:46,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:46,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:51:46,659 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 10:51:46,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1756845692, now seen corresponding path program 1 times [2025-04-29 10:51:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:46,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722391870] [2025-04-29 10:51:46,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:46,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:51:46,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:51:46,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:46,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:46,736 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:51:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:46,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722391870] [2025-04-29 10:51:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722391870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:51:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775768045] [2025-04-29 10:51:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:46,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:51:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:46,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:51:46,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:51:46,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-04-29 10:51:46,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:51:46,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:51:46,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-04-29 10:51:46,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:51:46,786 INFO L116 PetriNetUnfolderBase]: 15/60 cut-off events. [2025-04-29 10:51:46,786 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 10:51:46,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 60 events. 15/60 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 112 event pairs, 7 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 138. Up to 20 conditions per place. [2025-04-29 10:51:46,786 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 14 selfloop transitions, 4 changer transitions 8/29 dead transitions. [2025-04-29 10:51:46,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 152 flow [2025-04-29 10:51:46,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:51:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:51:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-29 10:51:46,787 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-29 10:51:46,787 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 98 flow. Second operand 6 states and 84 transitions. [2025-04-29 10:51:46,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 152 flow [2025-04-29 10:51:46,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 10:51:46,788 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 65 flow [2025-04-29 10:51:46,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2025-04-29 10:51:46,788 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-04-29 10:51:46,789 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 65 flow [2025-04-29 10:51:46,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:51:46,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:51:46,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:46,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:51:46,789 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 10:51:46,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1185489561, now seen corresponding path program 1 times [2025-04-29 10:51:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:51:46,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829849318] [2025-04-29 10:51:46,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:51:46,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:51:46,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:51:46,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:46,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:46,870 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:51:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:51:46,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829849318] [2025-04-29 10:51:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829849318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:46,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:51:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940820292] [2025-04-29 10:51:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:46,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:51:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:46,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:51:46,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:51:46,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-04-29 10:51:46,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 18 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:51:46,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:51:46,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-04-29 10:51:46,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:51:46,917 INFO L116 PetriNetUnfolderBase]: 10/39 cut-off events. [2025-04-29 10:51:46,917 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 10:51:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 39 events. 10/39 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 4 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 95. Up to 15 conditions per place. [2025-04-29 10:51:46,918 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2025-04-29 10:51:46,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 20 transitions, 104 flow [2025-04-29 10:51:46,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:51:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 10:51:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2025-04-29 10:51:46,918 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.363265306122449 [2025-04-29 10:51:46,919 INFO L175 Difference]: Start difference. First operand has 37 places, 18 transitions, 65 flow. Second operand 7 states and 89 transitions. [2025-04-29 10:51:46,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 20 transitions, 104 flow [2025-04-29 10:51:46,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 86 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-04-29 10:51:46,919 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2025-04-29 10:51:46,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2025-04-29 10:51:46,920 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2025-04-29 10:51:46,920 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2025-04-29 10:51:46,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:51:46,922 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-29 10:51:46,922 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-29 10:51:46,923 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 10:51:46,923 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-29 10:51:46,923 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-29 10:51:46,923 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-29 10:51:46,923 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-29 10:51:46,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:51:46,923 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 10:51:46,926 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:51:46,926 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:51:46,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:51:46 BasicIcfg [2025-04-29 10:51:46,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:51:46,929 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:51:46,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:51:46,930 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:51:46,930 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:45" (3/4) ... [2025-04-29 10:51:46,931 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:51:46,933 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 10:51:46,935 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-04-29 10:51:46,935 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 10:51:46,935 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:51:46,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:51:46,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:51:46,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:51:46,981 INFO L158 Benchmark]: Toolchain (without parser) took 1720.10ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 65.4MB in the end (delta: 67.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-04-29 10:51:46,981 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:51:46,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.45ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 118.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:51:46,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.99ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 117.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:51:46,982 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:51:46,982 INFO L158 Benchmark]: RCFGBuilder took 255.51ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 98.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:51:46,982 INFO L158 Benchmark]: TraceAbstraction took 1136.24ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 70.5MB in the end (delta: 27.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2025-04-29 10:51:46,982 INFO L158 Benchmark]: Witness Printer took 50.66ms. Allocated memory is still 167.8MB. Free memory was 70.5MB in the beginning and 65.4MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:51:46,983 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.45ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 118.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.99ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 117.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.51ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 98.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1136.24ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 70.5MB in the end (delta: 27.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Witness Printer took 50.66ms. Allocated memory is still 167.8MB. Free memory was 70.5MB in the beginning and 65.4MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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 - 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, 47 locations, 52 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 289 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 6 mSDtfsCounter, 289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, InterpolantAutomatonStates: 29, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 10:51:46,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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