./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/unwind2-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 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:49:15,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:49:15,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:49:15,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:49:15,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:49:15,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:49:15,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:49:15,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:49:15,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:49:15,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:49:15,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:49:15,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:49:15,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:49:15,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:49:15,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:49:15,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:49:15,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:49:15,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:49:15,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:49:15,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:49:15,675 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 -> 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d [2025-03-17 06:49:15,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:49:15,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:49:15,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:49:15,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:49:15,881 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:49:15,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-03-17 06:49:17,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb925ace/bae5f82be97144f293ce0fa3b5fb2dc0/FLAG5f16d3201 [2025-03-17 06:49:17,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:49:17,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-03-17 06:49:17,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb925ace/bae5f82be97144f293ce0fa3b5fb2dc0/FLAG5f16d3201 [2025-03-17 06:49:17,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb925ace/bae5f82be97144f293ce0fa3b5fb2dc0 [2025-03-17 06:49:17,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:49:17,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:49:17,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:49:17,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:49:17,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:49:17,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:17,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ae6b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17, skipping insertion in model container [2025-03-17 06:49:17,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:17,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:49:17,852 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/unwind2-nondet.i[33026,33039] [2025-03-17 06:49:17,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:49:17,883 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:49:17,928 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/unwind2-nondet.i[33026,33039] [2025-03-17 06:49:17,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:49:17,970 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:49:17,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17 WrapperNode [2025-03-17 06:49:17,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:49:17,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:49:17,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:49:17,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:49:17,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:17,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,006 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-03-17 06:49:18,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:49:18,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:49:18,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:49:18,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:49:18,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,031 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-17 06:49:18,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:49:18,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:49:18,049 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:49:18,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:49:18,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (1/1) ... [2025-03-17 06:49:18,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:49:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:49:18,081 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-17 06:49:18,086 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-17 06:49:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:49:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-17 06:49:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-17 06:49:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-17 06:49:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-17 06:49:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:49:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:49:18,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:49:18,107 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:49:18,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:49:18,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:49:18,384 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:49:18,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:49:18,479 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:49:18,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:49:18,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:49:18 BoogieIcfgContainer [2025-03-17 06:49:18,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:49:18,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:49:18,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:49:18,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:49:18,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:49:17" (1/3) ... [2025-03-17 06:49:18,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84f301c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:49:18, skipping insertion in model container [2025-03-17 06:49:18,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:49:17" (2/3) ... [2025-03-17 06:49:18,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84f301c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:49:18, skipping insertion in model container [2025-03-17 06:49:18,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:49:18" (3/3) ... [2025-03-17 06:49:18,494 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-03-17 06:49:18,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:49:18,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-17 06:49:18,507 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:49:18,554 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 06:49:18,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-03-17 06:49:18,621 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-17 06:49:18,623 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:49:18,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-17 06:49:18,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-03-17 06:49:18,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 61 flow [2025-03-17 06:49:18,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:49:18,647 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;@1e503dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:49:18,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:49:18,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:49:18,652 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-17 06:49:18,652 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:49:18,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:49:18,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:49:18,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 06:49:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:49:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 848759980, now seen corresponding path program 1 times [2025-03-17 06:49:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:49:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991803306] [2025-03-17 06:49:18,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:18,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:49:18,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:49:18,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:49:18,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:49:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:49:19,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991803306] [2025-03-17 06:49:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991803306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:49:19,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:49:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:49:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075189881] [2025-03-17 06:49:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:49:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:49:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:49:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:49:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:49:19,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-03-17 06:49:19,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 61 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-17 06:49:19,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:49:19,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-03-17 06:49:19,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:49:19,531 INFO L124 PetriNetUnfolderBase]: 381/717 cut-off events. [2025-03-17 06:49:19,531 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-17 06:49:19,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 717 events. 381/717 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3559 event pairs, 32 based on Foata normal form. 70/658 useless extension candidates. Maximal degree in co-relation 1304. Up to 185 conditions per place. [2025-03-17 06:49:19,539 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 75 selfloop transitions, 18 changer transitions 4/101 dead transitions. [2025-03-17 06:49:19,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 101 transitions, 429 flow [2025-03-17 06:49:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:49:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:49:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2025-03-17 06:49:19,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-17 06:49:19,552 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 61 flow. Second operand 11 states and 176 transitions. [2025-03-17 06:49:19,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 101 transitions, 429 flow [2025-03-17 06:49:19,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 101 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:49:19,563 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 167 flow [2025-03-17 06:49:19,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-17 06:49:19,570 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2025-03-17 06:49:19,570 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 167 flow [2025-03-17 06:49:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-17 06:49:19,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:49:19,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:49:19,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:49:19,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 06:49:19,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:49:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 541724981, now seen corresponding path program 1 times [2025-03-17 06:49:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:49:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834853444] [2025-03-17 06:49:19,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:49:19,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:49:19,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:49:19,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:19,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:19,704 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-17 06:49:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:49:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834853444] [2025-03-17 06:49:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834853444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:49:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769802068] [2025-03-17 06:49:19,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:19,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:49:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:49:19,707 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-17 06:49:19,709 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-17 06:49:19,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 06:49:19,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 06:49:19,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:19,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:19,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:49:19,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:49:19,815 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-17 06:49:19,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:49:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769802068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:49:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:49:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-17 06:49:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088884836] [2025-03-17 06:49:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:49:19,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:49:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:49:19,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:49:19,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:49:19,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-03-17 06:49:19,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-17 06:49:19,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:49:19,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-03-17 06:49:19,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:49:20,036 INFO L124 PetriNetUnfolderBase]: 345/702 cut-off events. [2025-03-17 06:49:20,036 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2025-03-17 06:49:20,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 702 events. 345/702 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3705 event pairs, 68 based on Foata normal form. 22/623 useless extension candidates. Maximal degree in co-relation 1636. Up to 167 conditions per place. [2025-03-17 06:49:20,041 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 72 selfloop transitions, 14 changer transitions 4/97 dead transitions. [2025-03-17 06:49:20,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 502 flow [2025-03-17 06:49:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:49:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:49:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2025-03-17 06:49:20,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562962962962963 [2025-03-17 06:49:20,043 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 167 flow. Second operand 9 states and 152 transitions. [2025-03-17 06:49:20,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 502 flow [2025-03-17 06:49:20,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:49:20,048 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 239 flow [2025-03-17 06:49:20,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-17 06:49:20,049 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2025-03-17 06:49:20,049 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 239 flow [2025-03-17 06:49:20,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-17 06:49:20,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:49:20,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:49:20,056 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-17 06:49:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:49:20,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 06:49:20,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:49:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1694683119, now seen corresponding path program 1 times [2025-03-17 06:49:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:49:20,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-17 06:49:20,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:49:20,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 06:49:20,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 06:49:20,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:20,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:20,310 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-17 06:49:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:49:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-17 06:49:20,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145653931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:49:20,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:49:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:49:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363538770] [2025-03-17 06:49:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:49:20,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:49:20,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:49:20,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:49:20,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:49:20,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-17 06:49:20,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-17 06:49:20,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:49:20,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-17 06:49:20,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:49:20,480 INFO L124 PetriNetUnfolderBase]: 396/836 cut-off events. [2025-03-17 06:49:20,481 INFO L125 PetriNetUnfolderBase]: For 952/954 co-relation queries the response was YES. [2025-03-17 06:49:20,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 836 events. 396/836 cut-off events. For 952/954 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4718 event pairs, 87 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 2090. Up to 290 conditions per place. [2025-03-17 06:49:20,485 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 64 selfloop transitions, 15 changer transitions 1/88 dead transitions. [2025-03-17 06:49:20,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 640 flow [2025-03-17 06:49:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:49:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:49:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2025-03-17 06:49:20,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-17 06:49:20,488 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 239 flow. Second operand 7 states and 112 transitions. [2025-03-17 06:49:20,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 640 flow [2025-03-17 06:49:20,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:49:20,496 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 314 flow [2025-03-17 06:49:20,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-03-17 06:49:20,499 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-03-17 06:49:20,499 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 314 flow [2025-03-17 06:49:20,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-17 06:49:20,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:49:20,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:49:20,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:49:20,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 06:49:20,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:49:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash -995599750, now seen corresponding path program 1 times [2025-03-17 06:49:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:49:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486619979] [2025-03-17 06:49:20,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:49:20,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 06:49:20,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 06:49:20,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:20,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:20,653 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-17 06:49:20,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:49:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486619979] [2025-03-17 06:49:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486619979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:49:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220381442] [2025-03-17 06:49:20,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:49:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:49:20,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:49:20,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:49:20,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 06:49:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 06:49:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:20,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:49:20,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:49:20,849 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-17 06:49:20,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:49:20,948 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-17 06:49:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220381442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:49:20,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:49:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-17 06:49:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368441768] [2025-03-17 06:49:20,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:49:20,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:49:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:49:20,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:49:20,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:49:20,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-03-17 06:49:20,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 314 flow. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 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-17 06:49:20,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:49:20,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-03-17 06:49:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:49:21,403 INFO L124 PetriNetUnfolderBase]: 774/1416 cut-off events. [2025-03-17 06:49:21,403 INFO L125 PetriNetUnfolderBase]: For 2076/2092 co-relation queries the response was YES. [2025-03-17 06:49:21,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 1416 events. 774/1416 cut-off events. For 2076/2092 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7889 event pairs, 99 based on Foata normal form. 2/1281 useless extension candidates. Maximal degree in co-relation 4326. Up to 357 conditions per place. [2025-03-17 06:49:21,411 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 99 selfloop transitions, 22 changer transitions 37/164 dead transitions. [2025-03-17 06:49:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 164 transitions, 1300 flow [2025-03-17 06:49:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:49:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 06:49:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2025-03-17 06:49:21,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2025-03-17 06:49:21,413 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 314 flow. Second operand 13 states and 188 transitions. [2025-03-17 06:49:21,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 164 transitions, 1300 flow [2025-03-17 06:49:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 164 transitions, 1279 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-17 06:49:21,423 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 422 flow [2025-03-17 06:49:21,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=422, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2025-03-17 06:49:21,424 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2025-03-17 06:49:21,424 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 422 flow [2025-03-17 06:49:21,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 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-17 06:49:21,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:49:21,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:49:21,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:49:21,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 06:49:21,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 06:49:21,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:49:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash 149485576, now seen corresponding path program 1 times [2025-03-17 06:49:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:49:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418315984] [2025-03-17 06:49:21,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:49:21,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:49:21,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:49:21,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:21,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:49:21,702 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-17 06:49:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:49:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418315984] [2025-03-17 06:49:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418315984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:49:21,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:49:21,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:49:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041358785] [2025-03-17 06:49:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:49:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:49:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:49:21,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:49:21,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:49:21,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-17 06:49:21,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-17 06:49:21,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:49:21,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-17 06:49:21,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:49:21,878 INFO L124 PetriNetUnfolderBase]: 552/1173 cut-off events. [2025-03-17 06:49:21,878 INFO L125 PetriNetUnfolderBase]: For 2557/2559 co-relation queries the response was YES. [2025-03-17 06:49:21,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 1173 events. 552/1173 cut-off events. For 2557/2559 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7142 event pairs, 101 based on Foata normal form. 18/1142 useless extension candidates. Maximal degree in co-relation 4357. Up to 558 conditions per place. [2025-03-17 06:49:21,886 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-03-17 06:49:21,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 750 flow [2025-03-17 06:49:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:49:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:49:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-03-17 06:49:21,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-03-17 06:49:21,888 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 422 flow. Second operand 6 states and 92 transitions. [2025-03-17 06:49:21,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 82 transitions, 750 flow [2025-03-17 06:49:21,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 693 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-17 06:49:21,905 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 419 flow [2025-03-17 06:49:21,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-03-17 06:49:21,907 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2025-03-17 06:49:21,907 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 419 flow [2025-03-17 06:49:21,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-17 06:49:21,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:49:21,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:49:21,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:49:21,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 06:49:21,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:49:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash -433214106, now seen corresponding path program 1 times [2025-03-17 06:49:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:49:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786168880] [2025-03-17 06:49:21,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:49:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:49:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:49:21,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:49:21,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:21,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:49:21,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:49:21,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 06:49:21,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 06:49:21,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:49:21,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:49:21,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:49:21,939 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:49:21,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-17 06:49:21,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-03-17 06:49:21,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-17 06:49:21,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-17 06:49:21,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-17 06:49:21,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-17 06:49:21,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:49:21,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 06:49:21,971 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:49:21,971 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:49:21,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:49:21 BasicIcfg [2025-03-17 06:49:21,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:49:21,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:49:21,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:49:21,977 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:49:21,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:49:18" (3/4) ... [2025-03-17 06:49:21,979 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:49:22,015 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-03-17 06:49:22,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:49:22,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:49:22,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:49:22,048 INFO L158 Benchmark]: Toolchain (without parser) took 4435.10ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 104.9MB in the beginning and 181.7MB in the end (delta: -76.8MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2025-03-17 06:49:22,048 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:49:22,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.16ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 85.1MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:49:22,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.88ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:49:22,049 INFO L158 Benchmark]: Boogie Preprocessor took 41.10ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:49:22,049 INFO L158 Benchmark]: IcfgBuilder took 430.64ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 60.9MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:49:22,049 INFO L158 Benchmark]: TraceAbstraction took 3492.46ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 59.9MB in the beginning and 188.8MB in the end (delta: -128.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2025-03-17 06:49:22,050 INFO L158 Benchmark]: Witness Printer took 70.50ms. Allocated memory is still 293.6MB. Free memory was 188.8MB in the beginning and 181.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:49:22,051 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.16ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 85.1MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.88ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.10ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 430.64ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 60.9MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3492.46ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 59.9MB in the beginning and 188.8MB in the end (delta: -128.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 70.50ms. Allocated memory is still 293.6MB. Free memory was 188.8MB in the beginning and 181.7MB in the end (delta: 7.0MB). 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; [L775] 0 _N = __VERIFIER_nondet_int() [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=0, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=0, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=1] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, lim=1, limit=0] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=0, expression=0, limit=0] [L753] 2 reach_error() VAL [\old(expression)=0, _N=0, expression=0, limit=0] - 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. - UnprovableResult [Line: 779]: 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: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 54 edges, 6 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: 3.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1007 IncrementalHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 5 mSDtfsCounter, 1007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 1.0s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 11 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1/5 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-17 06:49:22,065 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