./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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 ../sv-benchmarks/c/pthread-theta/unwind1-nondet.i -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 591990a0070f9287f734f2988edce5e1b5a43791c74b5c6b7374ff93ddaa2267 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:13:34,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:13:34,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:13:34,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:13:34,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:13:34,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:13:34,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:13:34,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:13:34,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:13:34,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:13:34,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:13:34,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:13:34,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:13:34,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:13:34,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:13:34,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:13:34,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:13:34,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:13:34,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:13:34,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:13:34,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:13:34,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:13:34,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:13:34,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:13:34,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:13:34,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:13:34,739 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 -> 591990a0070f9287f734f2988edce5e1b5a43791c74b5c6b7374ff93ddaa2267 [2025-03-14 01:13:34,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:13:34,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:13:34,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:13:34,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:13:34,971 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:13:34,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-nondet.i [2025-03-14 01:13:36,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d943fa87/c9c288dccb884252bd815516197ccaeb/FLAG8664317bc [2025-03-14 01:13:36,367 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:13:36,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-nondet.i [2025-03-14 01:13:36,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d943fa87/c9c288dccb884252bd815516197ccaeb/FLAG8664317bc [2025-03-14 01:13:36,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d943fa87/c9c288dccb884252bd815516197ccaeb [2025-03-14 01:13:36,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:13:36,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:13:36,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:13:36,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:13:36,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:13:36,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6619f569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36, skipping insertion in model container [2025-03-14 01:13:36,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:13:36,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-nondet.i[33026,33039] [2025-03-14 01:13:36,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:13:36,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:13:36,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-nondet.i[33026,33039] [2025-03-14 01:13:36,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:13:36,775 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:13:36,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36 WrapperNode [2025-03-14 01:13:36,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:13:36,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:13:36,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:13:36,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:13:36,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,807 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2025-03-14 01:13:36,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:13:36,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:13:36,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:13:36,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:13:36,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,827 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-03-14 01:13:36,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:13:36,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:13:36,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:13:36,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:13:36,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (1/1) ... [2025-03-14 01:13:36,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:13:36,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:36,864 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-03-14 01:13:36,867 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-03-14 01:13:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:13:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-14 01:13:36,886 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-14 01:13:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-14 01:13:36,886 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-14 01:13:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:13:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:13:36,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:13:36,887 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:13:36,981 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:13:36,982 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:13:37,089 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:13:37,090 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:13:37,090 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:13:37,173 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:13:37,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:37 BoogieIcfgContainer [2025-03-14 01:13:37,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:13:37,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:13:37,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:13:37,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:13:37,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:13:36" (1/3) ... [2025-03-14 01:13:37,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769b6396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:13:37, skipping insertion in model container [2025-03-14 01:13:37,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:36" (2/3) ... [2025-03-14 01:13:37,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769b6396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:13:37, skipping insertion in model container [2025-03-14 01:13:37,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:37" (3/3) ... [2025-03-14 01:13:37,181 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-nondet.i [2025-03-14 01:13:37,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:13:37,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-nondet.i that has 3 procedures, 22 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-14 01:13:37,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:13:37,224 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:13:37,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2025-03-14 01:13:37,268 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-14 01:13:37,270 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:13:37,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-14 01:13:37,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2025-03-14 01:13:37,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 49 flow [2025-03-14 01:13:37,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:13:37,292 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;@454337b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:13:37,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:13:37,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:13:37,303 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-03-14 01:13:37,303 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:13:37,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:37,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:37,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1869561251, now seen corresponding path program 1 times [2025-03-14 01:13:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:37,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594470300] [2025-03-14 01:13:37,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:37,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 01:13:37,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 01:13:37,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:37,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:37,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:37,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594470300] [2025-03-14 01:13:37,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594470300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:37,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:37,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:13:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938991211] [2025-03-14 01:13:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:13:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:37,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:13:37,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:13:37,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:37,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 49 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03-14 01:13:37,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:37,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:37,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:37,824 INFO L124 PetriNetUnfolderBase]: 203/358 cut-off events. [2025-03-14 01:13:37,824 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-14 01:13:37,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 358 events. 203/358 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1342 event pairs, 83 based on Foata normal form. 13/310 useless extension candidates. Maximal degree in co-relation 672. Up to 186 conditions per place. [2025-03-14 01:13:37,831 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 22 selfloop transitions, 3 changer transitions 21/47 dead transitions. [2025-03-14 01:13:37,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 47 transitions, 204 flow [2025-03-14 01:13:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:13:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:13:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-03-14 01:13:37,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-14 01:13:37,848 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 49 flow. Second operand 6 states and 66 transitions. [2025-03-14 01:13:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 47 transitions, 204 flow [2025-03-14 01:13:37,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:37,853 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 54 flow [2025-03-14 01:13:37,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=54, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2025-03-14 01:13:37,858 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2025-03-14 01:13:37,859 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 54 flow [2025-03-14 01:13:37,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03-14 01:13:37,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:37,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:37,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:13:37,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:37,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2121854580, now seen corresponding path program 1 times [2025-03-14 01:13:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:37,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92762773] [2025-03-14 01:13:37,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:37,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 01:13:37,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 01:13:37,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:37,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92762773] [2025-03-14 01:13:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92762773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:13:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613324783] [2025-03-14 01:13:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:37,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:13:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:37,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:13:37,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:13:37,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 01:13:37,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-03-14 01:13:37,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:37,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 01:13:37,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:38,034 INFO L124 PetriNetUnfolderBase]: 53/117 cut-off events. [2025-03-14 01:13:38,034 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-14 01:13:38,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 117 events. 53/117 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 318 event pairs, 18 based on Foata normal form. 13/119 useless extension candidates. Maximal degree in co-relation 261. Up to 55 conditions per place. [2025-03-14 01:13:38,035 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 16 selfloop transitions, 3 changer transitions 10/31 dead transitions. [2025-03-14 01:13:38,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 144 flow [2025-03-14 01:13:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:13:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:13:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-14 01:13:38,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-14 01:13:38,038 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 54 flow. Second operand 5 states and 55 transitions. [2025-03-14 01:13:38,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 144 flow [2025-03-14 01:13:38,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 135 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:38,040 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 61 flow [2025-03-14 01:13:38,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2025-03-14 01:13:38,041 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2025-03-14 01:13:38,042 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 61 flow [2025-03-14 01:13:38,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-03-14 01:13:38,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:38,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:38,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:13:38,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:38,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:38,044 INFO L85 PathProgramCache]: Analyzing trace with hash -169620638, now seen corresponding path program 1 times [2025-03-14 01:13:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:38,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617193882] [2025-03-14 01:13:38,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:38,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:38,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:38,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:38,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617193882] [2025-03-14 01:13:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617193882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928762619] [2025-03-14 01:13:38,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:38,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:38,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:38,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:38,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:13:38,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:38,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:38,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:38,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:38,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:13:38,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:38,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928762619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:38,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-14 01:13:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111215942] [2025-03-14 01:13:38,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:38,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:13:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:38,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:13:38,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:13:38,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:38,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 61 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-03-14 01:13:38,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:38,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:38,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:38,383 INFO L124 PetriNetUnfolderBase]: 66/141 cut-off events. [2025-03-14 01:13:38,383 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-14 01:13:38,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 141 events. 66/141 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 402 event pairs, 27 based on Foata normal form. 5/132 useless extension candidates. Maximal degree in co-relation 275. Up to 61 conditions per place. [2025-03-14 01:13:38,384 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 16 selfloop transitions, 2 changer transitions 17/36 dead transitions. [2025-03-14 01:13:38,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 185 flow [2025-03-14 01:13:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:13:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:13:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-03-14 01:13:38,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2025-03-14 01:13:38,387 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 61 flow. Second operand 6 states and 53 transitions. [2025-03-14 01:13:38,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 185 flow [2025-03-14 01:13:38,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 36 transitions, 171 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 01:13:38,388 INFO L231 Difference]: Finished difference. Result has 31 places, 16 transitions, 60 flow [2025-03-14 01:13:38,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=16} [2025-03-14 01:13:38,388 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2025-03-14 01:13:38,388 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 16 transitions, 60 flow [2025-03-14 01:13:38,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-03-14 01:13:38,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:38,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:38,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:13:38,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:38,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 746512194, now seen corresponding path program 1 times [2025-03-14 01:13:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128553833] [2025-03-14 01:13:38,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:38,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:38,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:13:38,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:13:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:38,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:38,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:13:38,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:13:38,632 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:13:38,633 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 01:13:38,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 01:13:38,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 01:13:38,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 01:13:38,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:13:38,635 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-14 01:13:38,659 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:13:38,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:13:38,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:13:38 BasicIcfg [2025-03-14 01:13:38,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:13:38,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:13:38,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:13:38,665 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:13:38,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:37" (3/4) ... [2025-03-14 01:13:38,667 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:13:38,705 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-14 01:13:38,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:13:38,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:13:38,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:13:38,743 INFO L158 Benchmark]: Toolchain (without parser) took 2343.97ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 52.1MB in the end (delta: 69.3MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2025-03-14 01:13:38,743 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:13:38,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.73ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 101.2MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:13:38,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.68ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:13:38,745 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:13:38,745 INFO L158 Benchmark]: IcfgBuilder took 337.48ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 76.0MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:13:38,745 INFO L158 Benchmark]: TraceAbstraction took 1489.08ms. Allocated memory is still 167.8MB. Free memory was 76.0MB in the beginning and 58.5MB in the end (delta: 17.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2025-03-14 01:13:38,745 INFO L158 Benchmark]: Witness Printer took 77.12ms. Allocated memory is still 167.8MB. Free memory was 58.5MB in the beginning and 52.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:13:38,746 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.73ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 101.2MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.68ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 337.48ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 76.0MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1489.08ms. Allocated memory is still 167.8MB. Free memory was 76.0MB in the beginning and 58.5MB in the end (delta: 17.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 77.12ms. Allocated memory is still 167.8MB. Free memory was 58.5MB in the beginning and 52.1MB in the end (delta: 6.4MB). There was no memory consumed. 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; [L772] 0 _N = __VERIFIER_nondet_int() [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=0, limit=0, t1=-1] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=0, arg={0:0}, limit=0, t1=-1, t2=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, limit=1] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=0, arg={0:0}, arg={0:0}, bound=1, i=0, limit=1] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=0, arg={0:0}, arg={0:0}, bound=1, i=1, limit=1] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=0, arg={0:0}, expression=0, limit=1] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=0, arg={0:0}, expression=0, limit=1] - UnprovableResult [Line: 776]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 37 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.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 0 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=2, InterpolantAutomatonStates: 17, 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.4s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 6 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/4 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-03-14 01:13:38,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE