/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 23:40:52,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 23:40:52,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 23:40:52,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 23:40:52,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 23:40:52,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 23:40:52,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 23:40:52,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 23:40:52,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 23:40:52,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 23:40:52,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 23:40:52,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 23:40:52,348 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 23:40:52,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 23:40:52,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 23:40:52,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 23:40:52,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 23:40:52,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 23:40:52,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 23:40:52,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 23:40:52,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 23:40:52,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 23:40:52,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 23:40:52,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 23:40:52,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 23:40:52,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 23:40:52,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 23:40:52,352 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 23:40:52,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 23:40:52,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 23:40:52,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 23:40:52,354 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 23:40:52,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 23:40:52,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 23:40:52,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 23:40:52,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 23:40:52,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 23:40:52,591 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 23:40:52,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-05-06 23:40:53,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 23:40:53,830 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 23:40:53,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-05-06 23:40:53,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5f86a5a74/8d9def1899a542fb967a9ef7edd9e44b/FLAG1893d7842 [2024-05-06 23:40:53,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5f86a5a74/8d9def1899a542fb967a9ef7edd9e44b [2024-05-06 23:40:53,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 23:40:53,865 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 23:40:53,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 23:40:53,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 23:40:53,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 23:40:53,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:40:53" (1/1) ... [2024-05-06 23:40:53,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7993c77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:53, skipping insertion in model container [2024-05-06 23:40:53,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:40:53" (1/1) ... [2024-05-06 23:40:53,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 23:40:54,171 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i[31166,31179] [2024-05-06 23:40:54,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 23:40:54,187 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 23:40:54,218 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i[31166,31179] [2024-05-06 23:40:54,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 23:40:54,252 INFO L206 MainTranslator]: Completed translation [2024-05-06 23:40:54,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54 WrapperNode [2024-05-06 23:40:54,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 23:40:54,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 23:40:54,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 23:40:54,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 23:40:54,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,295 INFO L138 Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 187 [2024-05-06 23:40:54,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 23:40:54,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 23:40:54,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 23:40:54,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 23:40:54,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 23:40:54,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 23:40:54,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 23:40:54,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 23:40:54,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (1/1) ... [2024-05-06 23:40:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 23:40:54,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:40:54,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 23:40:54,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-06 23:40:54,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 23:40:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 23:40:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 23:40:54,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 23:40:54,407 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 23:40:54,511 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 23:40:54,512 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 23:40:54,739 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 23:40:54,856 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 23:40:54,856 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-06 23:40:54,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:40:54 BoogieIcfgContainer [2024-05-06 23:40:54,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 23:40:54,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 23:40:54,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 23:40:54,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 23:40:54,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:40:53" (1/3) ... [2024-05-06 23:40:54,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbde77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:40:54, skipping insertion in model container [2024-05-06 23:40:54,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:40:54" (2/3) ... [2024-05-06 23:40:54,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbde77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:40:54, skipping insertion in model container [2024-05-06 23:40:54,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:40:54" (3/3) ... [2024-05-06 23:40:54,865 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-05-06 23:40:54,871 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 23:40:54,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 23:40:54,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 23:40:54,878 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 23:40:54,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 23:40:54,977 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 23:40:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 23:40:54,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:40:54,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 23:40:54,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 23:40:55,010 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 23:40:55,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:55,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 23:40:55,024 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@3d330b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 23:40:55,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-06 23:40:55,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-06 23:40:55,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -752136993, now seen corresponding path program 1 times [2024-05-06 23:40:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979073972] [2024-05-06 23:40:55,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:40:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:40:55,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:40:55,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979073972] [2024-05-06 23:40:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979073972] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:40:55,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 23:40:55,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-06 23:40:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319623501] [2024-05-06 23:40:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:40:55,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 23:40:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:40:55,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 23:40:55,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 23:40:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:55,491 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:40:55,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2024-05-06 23:40:55,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:55,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 23:40:55,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-06 23:40:55,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash 647420571, now seen corresponding path program 1 times [2024-05-06 23:40:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:55,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879635637] [2024-05-06 23:40:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:40:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:40:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:40:55,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879635637] [2024-05-06 23:40:55,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879635637] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:40:55,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 23:40:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 23:40:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470398095] [2024-05-06 23:40:55,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:40:55,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 23:40:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:40:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 23:40:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 23:40:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:55,791 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:40:55,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2024-05-06 23:40:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 23:40:55,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 23:40:55,923 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-06 23:40:55,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -456379130, now seen corresponding path program 1 times [2024-05-06 23:40:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017359241] [2024-05-06 23:40:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:40:55,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:40:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:40:56,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 23:40:56,021 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 23:40:56,022 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-05-06 23:40:56,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-05-06 23:40:56,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-05-06 23:40:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-06 23:40:56,032 INFO L448 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-05-06 23:40:56,033 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-06 23:40:56,033 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-05-06 23:40:56,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 23:40:56,099 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 23:40:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 23:40:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:40:56,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 23:40:56,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-06 23:40:56,148 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 23:40:56,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:56,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 23:40:56,149 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@3d330b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 23:40:56,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 23:40:56,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-05-06 23:40:56,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -796261520, now seen corresponding path program 1 times [2024-05-06 23:40:56,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472448687] [2024-05-06 23:40:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:56,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:40:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:40:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:40:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472448687] [2024-05-06 23:40:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472448687] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:40:56,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 23:40:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-06 23:40:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765991830] [2024-05-06 23:40:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:40:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 23:40:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:40:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 23:40:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 23:40:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:56,261 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:40:56,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2024-05-06 23:40:56,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:56,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-06 23:40:56,292 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-05-06 23:40:56,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -720439486, now seen corresponding path program 1 times [2024-05-06 23:40:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809578712] [2024-05-06 23:40:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:40:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:40:56,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:40:56,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809578712] [2024-05-06 23:40:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809578712] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:40:56,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 23:40:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 23:40:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441373068] [2024-05-06 23:40:56,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:40:56,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 23:40:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:40:56,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 23:40:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 23:40:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:56,487 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:40:56,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2024-05-06 23:40:56,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:56,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 23:40:56,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-06 23:40:56,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-05-06 23:40:56,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1603345388, now seen corresponding path program 1 times [2024-05-06 23:40:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:56,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465851614] [2024-05-06 23:40:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:40:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:40:56,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 23:40:56,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465851614] [2024-05-06 23:40:56,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465851614] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 23:40:56,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821236965] [2024-05-06 23:40:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:56,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:40:56,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 23:40:56,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 23:40:56,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-06 23:40:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 23:40:56,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2024-05-06 23:40:56,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 23:40:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:40:57,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 23:40:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821236965] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 23:40:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 23:40:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 11 [2024-05-06 23:40:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202744141] [2024-05-06 23:40:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 23:40:57,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-06 23:40:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:40:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 23:40:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-05-06 23:40:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:57,029 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:40:57,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2024-05-06 23:40:57,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:57,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-06 23:40:57,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:40:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 23:40:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 23:40:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 23:40:57,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-06 23:40:57,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 23:40:57,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-05-06 23:40:57,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 23:40:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -469312469, now seen corresponding path program 1 times [2024-05-06 23:40:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 23:40:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382011229] [2024-05-06 23:40:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 23:40:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 23:40:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:40:57,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 23:40:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 23:40:57,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 23:40:57,374 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 23:40:57,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 23:40:57,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-05-06 23:40:57,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 23:40:57,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-05-06 23:40:57,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-06 23:40:57,376 INFO L448 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-05-06 23:40:57,379 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-05-06 23:40:57,379 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 23:40:57,484 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated [2024-05-06 23:40:57,486 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated [2024-05-06 23:40:57,486 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated [2024-05-06 23:40:57,486 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2024-05-06 23:40:57,492 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2024-05-06 23:40:57,493 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated [2024-05-06 23:40:57,494 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated [2024-05-06 23:40:57,494 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated [2024-05-06 23:40:57,498 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2024-05-06 23:40:57,498 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2024-05-06 23:40:57,499 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2024-05-06 23:40:57,500 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2024-05-06 23:40:57,500 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2024-05-06 23:40:57,502 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2024-05-06 23:40:57,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:40:57 BasicIcfg [2024-05-06 23:40:57,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 23:40:57,517 INFO L158 Benchmark]: Toolchain (without parser) took 3652.37ms. Allocated memory was 271.6MB in the beginning and 352.3MB in the end (delta: 80.7MB). Free memory was 199.2MB in the beginning and 293.0MB in the end (delta: -93.8MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2024-05-06 23:40:57,517 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 271.6MB. Free memory is still 243.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 23:40:57,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.44ms. Allocated memory is still 271.6MB. Free memory was 199.2MB in the beginning and 178.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-06 23:40:57,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.64ms. Allocated memory is still 271.6MB. Free memory was 178.2MB in the beginning and 175.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 23:40:57,518 INFO L158 Benchmark]: Boogie Preprocessor took 20.39ms. Allocated memory is still 271.6MB. Free memory was 175.6MB in the beginning and 174.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 23:40:57,518 INFO L158 Benchmark]: RCFGBuilder took 540.15ms. Allocated memory is still 271.6MB. Free memory was 174.0MB in the beginning and 212.4MB in the end (delta: -38.3MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2024-05-06 23:40:57,518 INFO L158 Benchmark]: TraceAbstraction took 2656.87ms. Allocated memory was 271.6MB in the beginning and 352.3MB in the end (delta: 80.7MB). Free memory was 210.8MB in the beginning and 293.0MB in the end (delta: -82.2MB). Peak memory consumption was 133.8MB. Max. memory is 8.0GB. [2024-05-06 23:40:57,519 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.10ms. Allocated memory is still 271.6MB. Free memory is still 243.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 385.44ms. Allocated memory is still 271.6MB. Free memory was 199.2MB in the beginning and 178.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.64ms. Allocated memory is still 271.6MB. Free memory was 178.2MB in the beginning and 175.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.39ms. Allocated memory is still 271.6MB. Free memory was 175.6MB in the beginning and 174.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 540.15ms. Allocated memory is still 271.6MB. Free memory was 174.0MB in the beginning and 212.4MB in the end (delta: -38.3MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2656.87ms. Allocated memory was 271.6MB in the beginning and 352.3MB in the end (delta: 80.7MB). Free memory was 210.8MB in the beginning and 293.0MB in the end (delta: -82.2MB). Peak memory consumption was 133.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 613, independent: 491, independent conditional: 334, independent unconditional: 157, dependent: 122, dependent conditional: 122, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 334, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 334, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 334, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 84, independent unconditional: 407, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 491, independent: 491, independent conditional: 12, independent unconditional: 479, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 12, independent unconditional: 479, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 256, independent: 256, independent conditional: 3, independent unconditional: 253, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 256, independent: 256, independent conditional: 0, independent unconditional: 256, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 491, independent: 235, independent conditional: 9, independent unconditional: 226, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 256, unknown conditional: 3, unknown unconditional: 253] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 3, Positive unconditional cache size: 253, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 84, independent unconditional: 407, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 491, independent: 491, independent conditional: 12, independent unconditional: 479, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 491, independent: 491, independent conditional: 12, independent unconditional: 479, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 256, independent: 256, independent conditional: 3, independent unconditional: 253, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 256, independent: 256, independent conditional: 0, independent unconditional: 256, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 491, independent: 235, independent conditional: 9, independent unconditional: 226, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 256, unknown conditional: 3, unknown unconditional: 253] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 3, Positive unconditional cache size: 253, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72 ], Independence queries for same thread: 122 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1273, independent: 1139, independent conditional: 982, independent unconditional: 157, dependent: 134, dependent conditional: 134, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 982, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 982, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 982, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 359, independent unconditional: 780, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 36, independent unconditional: 1103, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 36, independent unconditional: 1103, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 298, independent: 298, independent conditional: 7, independent unconditional: 291, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 298, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1139, independent: 841, independent conditional: 29, independent unconditional: 812, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 298, unknown conditional: 7, unknown unconditional: 291] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 298, Positive conditional cache size: 7, Positive unconditional cache size: 291, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 323, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 359, independent unconditional: 780, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 36, independent unconditional: 1103, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1139, independent: 1139, independent conditional: 36, independent unconditional: 1103, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 298, independent: 298, independent conditional: 7, independent unconditional: 291, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 298, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1139, independent: 841, independent conditional: 29, independent unconditional: 812, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 298, unknown conditional: 7, unknown unconditional: 291] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 298, Positive conditional cache size: 7, Positive unconditional cache size: 291, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 323 ], Independence queries for same thread: 134 - CounterExampleResult [Line: 759]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L714] 0 int memory[(2*320+1)]; [L715] 0 int next_alloc_idx = 1; VAL [next_alloc_idx=1] [L716] 0 int m = 0; VAL [m={3:0}, next_alloc_idx=1] [L717] 0 int top; VAL [m={3:0}, next_alloc_idx=1, top={4:0}] [L769] 0 int m2 = 0; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, top={4:0}] [L770] 0 int state = 0; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, top={4:0}] [L788] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={9:0}, top={4:0}] [L789] COND TRUE 0 1 VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={9:0}, top={4:0}] [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={9:0}, top={4:0}] [L773] CALL 1 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L773] RET 1 __VERIFIER_atomic_acquire(&m2) [L776] 1 case 0: [L777] CALL 1 EBStack_init() [L732] 1 top = 0 VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, top={4:0}] [L777] RET 1 EBStack_init() [L778] 1 state = 1 VAL [arg={0:0}, arg={0:0}, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L779] 1 case 1: VAL [arg={0:0}, arg={0:0}, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L780] CALL 1 __VERIFIER_atomic_release(&m2) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L780] RET 1 __VERIFIER_atomic_release(&m2) [L781] CALL 1 push_loop() [L762] 1 int r = -1; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, r=-1, state=1, top={4:0}] [L763] 1 int arg = __VERIFIER_nondet_int(); VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=1, r=-1, state=1, top={4:0}] [L764] COND TRUE 1 1 [L765] CALL, EXPR 1 push(arg) [L741] 1 int oldTop = -1, newTop = -1, casret = -1; VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=-1, next_alloc_idx=1, oldTop=-1, state=1, top={4:0}] [L742] CALL, EXPR 1 index_malloc() [L719] 1 int curr_alloc_idx = -1; VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L720] CALL 1 __VERIFIER_atomic_acquire(&m) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L720] RET 1 __VERIFIER_atomic_acquire(&m) [L721] COND FALSE 1 !(next_alloc_idx+2-1 > (2*320+1)) VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L725] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L726] 1 next_alloc_idx += 2 VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4:0}] [L727] CALL 1 __VERIFIER_atomic_release(&m) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L727] RET 1 __VERIFIER_atomic_release(&m) [L729] 1 return curr_alloc_idx; VAL [\result=1, curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4:0}] [L742] RET, EXPR 1 index_malloc() [L742] 1 newTop = index_malloc() VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L743] COND FALSE 1 !(newTop == 0) VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L746] 1 memory[newTop+0] = d VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L789] COND TRUE 0 1 VAL [m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, t={9:0}, top={4:0}] [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, t={9:0}, top={4:0}] [L773] CALL 2 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 2 \read(*m) [L691] CALL 2 assume_abort_if_not(*m==0) [L4] COND FALSE 2 !(!cond) [L691] RET 2 assume_abort_if_not(*m==0) [L692] 2 *m = 1 [L773] RET 2 __VERIFIER_atomic_acquire(&m2) [L776] 2 case 0: VAL [arg={0:0}, arg={0:0}, m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4:0}] [L779] 2 case 1: VAL [arg={0:0}, arg={0:0}, m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4:0}] [L780] CALL 2 __VERIFIER_atomic_release(&m2) [L696] EXPR 2 \read(*m) [L696] CALL 2 assume_abort_if_not(*m==1) [L4] COND FALSE 2 !(!cond) [L696] RET 2 assume_abort_if_not(*m==1) [L697] 2 *m = 0 [L780] RET 2 __VERIFIER_atomic_release(&m2) [L781] CALL 2 push_loop() [L762] 2 int r = -1; VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, r=-1, state=1, top={4:0}] [L763] 2 int arg = __VERIFIER_nondet_int(); VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, r=-1, state=1, top={4:0}] [L747] COND TRUE 1 1 VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L748] EXPR 1 \read(top) VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L748] 1 oldTop = top VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L749] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L750] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L705] EXPR 1 \read(*v) [L705] COND TRUE 1 *v == e [L707] 1 *v = u [L707] 1 *r = 1 [L750] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L751] EXPR 1 \read(casret) VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L751] COND TRUE 1 casret==1 VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L752] 1 return 1; VAL [\old(d)=0, \result=1, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L741] 1 int oldTop = -1, newTop = -1, casret = -1; VAL [\old(d)=0, \result=1, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L752] 1 return 1; VAL [\old(d)=0, \result=1, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L765] RET, EXPR 1 push(arg) [L765] 1 r = push(arg) VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4:0}] [L766] CALL 1 __VERIFIER_atomic_assert(r) [L759] EXPR 1 !r || !isEmpty() [L759] CALL, EXPR 1 isEmpty() [L735] EXPR 1 \read(top) [L735] COND FALSE 1 !(top == 0) [L738] 1 return 0; [L759] RET, EXPR 1 isEmpty() [L759] EXPR 1 !r || !isEmpty() [L759] COND TRUE 1 !(!(!r || !isEmpty())) [L759] 1 reach_error() VAL [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4:0}] - UnprovableResult [Line: 789]: 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 3 procedures, 181 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 254 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, 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.5s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 818 SizeOfPredicates, 1 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 9/14 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 23:40:57,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-06 23:40:57,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 23:40:57,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...