./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:52:00,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:52:00,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:52:00,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:52:00,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:52:00,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:52:00,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:52:00,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:52:00,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:52:00,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:52:00,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:52:00,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:52:00,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:52:00,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:00,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:00,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:52:00,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:52:00,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-01-09 16:52:00,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:52:00,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:52:00,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:52:00,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:52:00,601 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:52:00,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-01-09 16:52:01,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d557ad005/ff8fd3cd9fae4c14875cdfe5edaa6c96/FLAGee02b262b [2025-01-09 16:52:01,990 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:52:01,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-01-09 16:52:02,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d557ad005/ff8fd3cd9fae4c14875cdfe5edaa6c96/FLAGee02b262b [2025-01-09 16:52:02,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d557ad005/ff8fd3cd9fae4c14875cdfe5edaa6c96 [2025-01-09 16:52:02,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:52:02,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:52:02,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:52:02,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:52:02,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:52:02,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72116ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02, skipping insertion in model container [2025-01-09 16:52:02,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:52:02,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i[33026,33039] [2025-01-09 16:52:02,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:52:02,269 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:52:02,300 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i[33026,33039] [2025-01-09 16:52:02,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:52:02,334 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:52:02,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02 WrapperNode [2025-01-09 16:52:02,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:52:02,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:52:02,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:52:02,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:52:02,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,370 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-01-09 16:52:02,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:52:02,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:52:02,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:52:02,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:52:02,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,387 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:52:02,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:52:02,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:52:02,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:52:02,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:52:02,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (1/1) ... [2025-01-09 16:52:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:02,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:52:02,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:52:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:52:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-09 16:52:02,447 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-09 16:52:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-09 16:52:02,447 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-09 16:52:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:52:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:52:02,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:52:02,448 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:52:02,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:52:02,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:52:02,636 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:52:02,637 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:52:02,724 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:52:02,724 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:52:02,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:02 BoogieIcfgContainer [2025-01-09 16:52:02,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:52:02,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:52:02,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:52:02,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:52:02,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:52:02" (1/3) ... [2025-01-09 16:52:02,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca0dcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:02, skipping insertion in model container [2025-01-09 16:52:02,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:02" (2/3) ... [2025-01-09 16:52:02,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca0dcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:02, skipping insertion in model container [2025-01-09 16:52:02,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:02" (3/3) ... [2025-01-09 16:52:02,733 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-01-09 16:52:02,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:52:02,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:52:02,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:52:02,792 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:52:02,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2025-01-09 16:52:02,838 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-01-09 16:52:02,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:52:02,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2025-01-09 16:52:02,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2025-01-09 16:52:02,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2025-01-09 16:52:02,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:52:02,860 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a0fa44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:52:02,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:52:02,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:52:02,866 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-01-09 16:52:02,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:52:02,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:02,866 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:02,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -40800846, now seen corresponding path program 1 times [2025-01-09 16:52:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:02,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172392545] [2025-01-09 16:52:02,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:02,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:52:03,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:52:03,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172392545] [2025-01-09 16:52:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172392545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:52:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641781554] [2025-01-09 16:52:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:03,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:52:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:03,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:52:03,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:52:03,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-01-09 16:52:03,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 43 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:03,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-01-09 16:52:03,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:03,240 INFO L124 PetriNetUnfolderBase]: 28/72 cut-off events. [2025-01-09 16:52:03,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:52:03,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 72 events. 28/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 178 event pairs, 6 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 127. Up to 48 conditions per place. [2025-01-09 16:52:03,242 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 13 selfloop transitions, 4 changer transitions 0/21 dead transitions. [2025-01-09 16:52:03,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 82 flow [2025-01-09 16:52:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:52:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:52:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-01-09 16:52:03,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-01-09 16:52:03,251 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 43 flow. Second operand 5 states and 54 transitions. [2025-01-09 16:52:03,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 82 flow [2025-01-09 16:52:03,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:52:03,255 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 50 flow [2025-01-09 16:52:03,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2025-01-09 16:52:03,259 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-01-09 16:52:03,259 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 50 flow [2025-01-09 16:52:03,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:03,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:03,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:52:03,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:03,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash -714297546, now seen corresponding path program 1 times [2025-01-09 16:52:03,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:03,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640420543] [2025-01-09 16:52:03,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:03,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:52:03,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:52:03,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:03,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640420543] [2025-01-09 16:52:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640420543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:03,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:03,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:52:03,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652981769] [2025-01-09 16:52:03,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:03,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:52:03,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:03,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:52:03,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:52:03,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-01-09 16:52:03,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:03,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-01-09 16:52:03,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:03,429 INFO L124 PetriNetUnfolderBase]: 50/114 cut-off events. [2025-01-09 16:52:03,429 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 16:52:03,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 114 events. 50/114 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 331 event pairs, 16 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 222. Up to 47 conditions per place. [2025-01-09 16:52:03,430 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 21 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2025-01-09 16:52:03,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 142 flow [2025-01-09 16:52:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:52:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:52:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-01-09 16:52:03,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:52:03,432 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 50 flow. Second operand 6 states and 66 transitions. [2025-01-09 16:52:03,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 142 flow [2025-01-09 16:52:03,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:52:03,432 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 85 flow [2025-01-09 16:52:03,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=85, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2025-01-09 16:52:03,433 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2025-01-09 16:52:03,433 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 85 flow [2025-01-09 16:52:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:03,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:52:03,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -668418084, now seen corresponding path program 1 times [2025-01-09 16:52:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172769841] [2025-01-09 16:52:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:03,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:52:03,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:52:03,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172769841] [2025-01-09 16:52:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172769841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:52:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883450849] [2025-01-09 16:52:03,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:03,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:03,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:52:03,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:52:03,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:52:03,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:52:03,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:52:03,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:52:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883450849] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:52:03,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:52:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-09 16:52:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502284330] [2025-01-09 16:52:03,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:52:03,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:52:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:03,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:52:03,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:52:03,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-01-09 16:52:03,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 85 flow. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:03,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-01-09 16:52:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:03,903 INFO L124 PetriNetUnfolderBase]: 68/142 cut-off events. [2025-01-09 16:52:03,903 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 16:52:03,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 142 events. 68/142 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 442 event pairs, 27 based on Foata normal form. 10/135 useless extension candidates. Maximal degree in co-relation 377. Up to 70 conditions per place. [2025-01-09 16:52:03,905 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 17 selfloop transitions, 7 changer transitions 7/36 dead transitions. [2025-01-09 16:52:03,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 193 flow [2025-01-09 16:52:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:52:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:52:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-01-09 16:52:03,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-01-09 16:52:03,907 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 85 flow. Second operand 7 states and 72 transitions. [2025-01-09 16:52:03,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 193 flow [2025-01-09 16:52:03,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 184 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:52:03,909 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 121 flow [2025-01-09 16:52:03,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2025-01-09 16:52:03,909 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 15 predicate places. [2025-01-09 16:52:03,909 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 121 flow [2025-01-09 16:52:03,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:03,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:03,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:52:04,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:04,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:04,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash 753845238, now seen corresponding path program 2 times [2025-01-09 16:52:04,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:04,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294245311] [2025-01-09 16:52:04,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:52:04,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:04,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:52:04,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:52:04,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:52:04,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294245311] [2025-01-09 16:52:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294245311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:52:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715201521] [2025-01-09 16:52:04,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:52:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:04,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:52:04,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:52:04,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:52:04,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:52:04,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:52:04,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:04,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:52:04,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:04,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:52:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715201521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:04,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:52:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-09 16:52:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606044054] [2025-01-09 16:52:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:04,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:52:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:04,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:52:04,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:52:04,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-01-09 16:52:04,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-01-09 16:52:04,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:04,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-01-09 16:52:04,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:04,488 INFO L124 PetriNetUnfolderBase]: 48/112 cut-off events. [2025-01-09 16:52:04,488 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-09 16:52:04,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 112 events. 48/112 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 290 event pairs, 12 based on Foata normal form. 8/120 useless extension candidates. Maximal degree in co-relation 341. Up to 54 conditions per place. [2025-01-09 16:52:04,489 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 18 selfloop transitions, 2 changer transitions 13/36 dead transitions. [2025-01-09 16:52:04,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 221 flow [2025-01-09 16:52:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:52:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:52:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-01-09 16:52:04,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2025-01-09 16:52:04,490 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 121 flow. Second operand 8 states and 81 transitions. [2025-01-09 16:52:04,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 221 flow [2025-01-09 16:52:04,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 208 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 16:52:04,492 INFO L231 Difference]: Finished difference. Result has 42 places, 19 transitions, 87 flow [2025-01-09 16:52:04,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=19} [2025-01-09 16:52:04,492 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2025-01-09 16:52:04,492 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 19 transitions, 87 flow [2025-01-09 16:52:04,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-01-09 16:52:04,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:04,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:04,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:52:04,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:04,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:04,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash -957900241, now seen corresponding path program 1 times [2025-01-09 16:52:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:04,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469112360] [2025-01-09 16:52:04,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:04,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:52:04,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:52:04,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:04,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:52:04,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:52:04,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:52:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:52:04,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:04,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:52:04,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:52:04,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:52:04,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:52:04,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:52:04,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:52:04,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:52:04,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:52:04,754 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-01-09 16:52:04,792 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:52:04,793 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:52:04,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:52:04 BasicIcfg [2025-01-09 16:52:04,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:52:04,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:52:04,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:52:04,801 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:52:04,801 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:02" (3/4) ... [2025-01-09 16:52:04,802 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:52:04,862 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-01-09 16:52:04,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:52:04,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:52:04,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:52:04,929 INFO L158 Benchmark]: Toolchain (without parser) took 2893.75ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 65.4MB in the end (delta: 45.8MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,929 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.53ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 90.8MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.73ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,929 INFO L158 Benchmark]: Boogie Preprocessor took 34.34ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,929 INFO L158 Benchmark]: RCFGBuilder took 318.28ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 69.3MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,930 INFO L158 Benchmark]: TraceAbstraction took 2074.60ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 72.9MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,930 INFO L158 Benchmark]: Witness Printer took 123.62ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 65.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,931 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.53ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 90.8MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.73ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.34ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 318.28ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 69.3MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2074.60ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 72.9MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 123.62ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 65.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, l=1, limit=2] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, l=1, limit=2] - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 5 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=3, InterpolantAutomatonStates: 26, 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.6s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 5 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5/9 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:52:04,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE