/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-25 23:20:10,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-25 23:20:10,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-25 23:20:10,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-25 23:20:10,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-25 23:20:10,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-25 23:20:10,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-25 23:20:10,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-25 23:20:10,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-25 23:20:10,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-25 23:20:10,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-25 23:20:10,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-25 23:20:10,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-25 23:20:10,124 INFO L153 SettingsManager]: * Use SBE=true [2024-01-25 23:20:10,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-25 23:20:10,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-25 23:20:10,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-25 23:20:10,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-25 23:20:10,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-25 23:20:10,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-25 23:20:10,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-25 23:20:10,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-25 23:20:10,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-25 23:20:10,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-25 23:20:10,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-25 23:20:10,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-25 23:20:10,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-25 23:20:10,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-25 23:20:10,134 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-25 23:20:10,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-25 23:20:10,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:20:10,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-25 23:20:10,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-25 23:20:10,135 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-25 23:20:10,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-25 23:20:10,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-25 23:20:10,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-25 23:20:10,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-25 23:20:10,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-25 23:20:10,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-25 23:20:10,136 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-25 23:20:10,136 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-25 23:20:10,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-25 23:20:10,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-25 23:20:10,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-25 23:20:10,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-25 23:20:10,330 INFO L274 PluginConnector]: CDTParser initialized [2024-01-25 23:20:10,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2024-01-25 23:20:11,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-25 23:20:11,501 INFO L384 CDTParser]: Found 1 translation units. [2024-01-25 23:20:11,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2024-01-25 23:20:11,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fefce4f6c/66605a2de0cc42ecaec492f5c9fd751b/FLAG1b8a10dcb [2024-01-25 23:20:11,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fefce4f6c/66605a2de0cc42ecaec492f5c9fd751b [2024-01-25 23:20:11,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-25 23:20:11,528 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-25 23:20:11,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-25 23:20:11,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-25 23:20:11,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-25 23:20:11,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d22ea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11, skipping insertion in model container [2024-01-25 23:20:11,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-25 23:20:11,672 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i[1105,1118] [2024-01-25 23:20:11,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:20:11,803 INFO L202 MainTranslator]: Completed pre-run [2024-01-25 23:20:11,810 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i[1105,1118] [2024-01-25 23:20:11,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:20:11,863 INFO L206 MainTranslator]: Completed translation [2024-01-25 23:20:11,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11 WrapperNode [2024-01-25 23:20:11,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-25 23:20:11,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-25 23:20:11,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-25 23:20:11,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-25 23:20:11,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,911 INFO L138 Inliner]: procedures = 163, calls = 48, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2024-01-25 23:20:11,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-25 23:20:11,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-25 23:20:11,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-25 23:20:11,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-25 23:20:11,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-25 23:20:11,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-25 23:20:11,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-25 23:20:11,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-25 23:20:11,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (1/1) ... [2024-01-25 23:20:11,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:20:11,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:20:11,963 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-01-25 23:20:11,984 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-01-25 23:20:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-25 23:20:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-25 23:20:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-25 23:20:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-25 23:20:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-25 23:20:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-25 23:20:11,988 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-25 23:20:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-25 23:20:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-25 23:20:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-25 23:20:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-25 23:20:11,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-25 23:20:11,990 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-25 23:20:12,108 INFO L241 CfgBuilder]: Building ICFG [2024-01-25 23:20:12,109 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-25 23:20:12,254 INFO L282 CfgBuilder]: Performing block encoding [2024-01-25 23:20:12,279 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-25 23:20:12,279 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-25 23:20:12,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:20:12 BoogieIcfgContainer [2024-01-25 23:20:12,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-25 23:20:12,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-25 23:20:12,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-25 23:20:12,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-25 23:20:12,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 11:20:11" (1/3) ... [2024-01-25 23:20:12,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ede35d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:20:12, skipping insertion in model container [2024-01-25 23:20:12,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:20:11" (2/3) ... [2024-01-25 23:20:12,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ede35d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:20:12, skipping insertion in model container [2024-01-25 23:20:12,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:20:12" (3/3) ... [2024-01-25 23:20:12,292 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2024-01-25 23:20:12,298 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-25 23:20:12,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-25 23:20:12,304 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-25 23:20:12,304 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-25 23:20:12,334 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-25 23:20:12,360 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:20:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:20:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:20:12,362 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-01-25 23:20:12,370 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-01-25 23:20:12,391 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:20:12,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:20:12,400 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=LoopsAndPotentialCycles, 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;@21ba2274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:20:12,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-25 23:20:12,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:12,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1939242853, now seen corresponding path program 1 times [2024-01-25 23:20:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379674042] [2024-01-25 23:20:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:12,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379674042] [2024-01-25 23:20:12,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379674042] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:12,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:12,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:20:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894922601] [2024-01-25 23:20:12,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:12,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:20:12,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:20:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:20:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:12,808 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:12,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-01-25 23:20:12,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-25 23:20:13,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:13,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1904814871, now seen corresponding path program 1 times [2024-01-25 23:20:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292184658] [2024-01-25 23:20:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292184658] [2024-01-25 23:20:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292184658] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:20:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779548888] [2024-01-25 23:20:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:13,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:20:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:20:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:20:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:13,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-01-25 23:20:13,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:13,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-25 23:20:13,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:13,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 107961849, now seen corresponding path program 1 times [2024-01-25 23:20:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692658939] [2024-01-25 23:20:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:13,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692658939] [2024-01-25 23:20:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692658939] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:13,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:13,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-25 23:20:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569087640] [2024-01-25 23:20:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:13,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-25 23:20:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-25 23:20:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-01-25 23:20:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:13,551 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:13,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-01-25 23:20:13,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:13,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-25 23:20:13,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-25 23:20:13,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:13,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1195728789, now seen corresponding path program 2 times [2024-01-25 23:20:13,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:13,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518552801] [2024-01-25 23:20:13,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518552801] [2024-01-25 23:20:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518552801] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:13,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:20:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920269734] [2024-01-25 23:20:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:13,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:20:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:13,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:20:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:20:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:13,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-25 23:20:13,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:13,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-25 23:20:13,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:20:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:20:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-25 23:20:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:13,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:20:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-25 23:20:13,955 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-01-25 23:20:13,956 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-01-25 23:20:13,959 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:20:13,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:20:13,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:20:14,000 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-01-25 23:20:14,001 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-01-25 23:20:14,003 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:20:14,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:20:14,004 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=LoopsAndPotentialCycles, 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;@21ba2274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:20:14,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:20:14,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:14,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 727313337, now seen corresponding path program 1 times [2024-01-25 23:20:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009743220] [2024-01-25 23:20:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009743220] [2024-01-25 23:20:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009743220] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:14,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:14,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:20:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507954896] [2024-01-25 23:20:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:14,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:20:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:20:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:20:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:14,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:20:14,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-25 23:20:14,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:14,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1230560342, now seen corresponding path program 1 times [2024-01-25 23:20:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926060789] [2024-01-25 23:20:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926060789] [2024-01-25 23:20:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926060789] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-25 23:20:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188858050] [2024-01-25 23:20:14,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:14,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-25 23:20:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-25 23:20:14,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-25 23:20:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:14,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-01-25 23:20:14,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:14,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-25 23:20:14,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:14,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1098234158, now seen corresponding path program 1 times [2024-01-25 23:20:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:14,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753530169] [2024-01-25 23:20:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753530169] [2024-01-25 23:20:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753530169] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:14,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:14,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:20:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439288615] [2024-01-25 23:20:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:14,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:20:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:20:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:20:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,411 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:14,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-01-25 23:20:14,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:14,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:20:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:14,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-25 23:20:14,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:14,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash -351317934, now seen corresponding path program 2 times [2024-01-25 23:20:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788131541] [2024-01-25 23:20:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:14,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788131541] [2024-01-25 23:20:14,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788131541] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:20:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138354333] [2024-01-25 23:20:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:14,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:20:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:20:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:20:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:14,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-01-25 23:20:14,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:14,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:14,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:14,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:20:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:15,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-25 23:20:15,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:20:15,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:20:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -240529774, now seen corresponding path program 1 times [2024-01-25 23:20:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:20:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194844532] [2024-01-25 23:20:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:20:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:20:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:20:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:20:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:20:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194844532] [2024-01-25 23:20:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194844532] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:20:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:20:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-25 23:20:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226795569] [2024-01-25 23:20:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:20:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-25 23:20:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:20:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-25 23:20:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-01-25 23:20:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:15,205 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:20:15,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-01-25 23:20:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:15,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:15,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:15,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:20:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:20:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:20:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:20:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-25 23:20:16,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:20:16,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-25 23:20:16,113 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-01-25 23:20:16,113 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/3) [2024-01-25 23:20:16,115 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:20:16,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:20:16,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:20:16,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-25 23:20:16,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-01-25 23:20:16,122 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:20:16,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-25 23:20:16,123 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=LoopsAndPotentialCycles, 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;@21ba2274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:20:16,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-25 23:20:16,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-25 23:20:16,125 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-01-25 23:20:16,125 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-01-25 23:20:16,126 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-25 23:20:16,126 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-25 23:20:16,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 11:20:16 BasicIcfg [2024-01-25 23:20:16,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-25 23:20:16,139 INFO L158 Benchmark]: Toolchain (without parser) took 4610.34ms. Allocated memory was 230.7MB in the beginning and 357.6MB in the end (delta: 126.9MB). Free memory was 189.6MB in the beginning and 276.8MB in the end (delta: -87.3MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2024-01-25 23:20:16,139 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 230.7MB. Free memory is still 183.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-25 23:20:16,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.56ms. Allocated memory is still 230.7MB. Free memory was 189.1MB in the beginning and 169.1MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-01-25 23:20:16,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.63ms. Allocated memory is still 230.7MB. Free memory was 169.1MB in the beginning and 167.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-25 23:20:16,139 INFO L158 Benchmark]: Boogie Preprocessor took 27.25ms. Allocated memory is still 230.7MB. Free memory was 167.0MB in the beginning and 165.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-25 23:20:16,140 INFO L158 Benchmark]: RCFGBuilder took 339.81ms. Allocated memory is still 230.7MB. Free memory was 165.2MB in the beginning and 146.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-01-25 23:20:16,140 INFO L158 Benchmark]: TraceAbstraction took 3857.45ms. Allocated memory was 230.7MB in the beginning and 357.6MB in the end (delta: 126.9MB). Free memory was 146.1MB in the beginning and 276.8MB in the end (delta: -130.8MB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-25 23:20:16,141 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.09ms. Allocated memory is still 230.7MB. Free memory is still 183.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.56ms. Allocated memory is still 230.7MB. Free memory was 189.1MB in the beginning and 169.1MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.63ms. Allocated memory is still 230.7MB. Free memory was 169.1MB in the beginning and 167.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.25ms. Allocated memory is still 230.7MB. Free memory was 167.0MB in the beginning and 165.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 339.81ms. Allocated memory is still 230.7MB. Free memory was 165.2MB in the beginning and 146.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3857.45ms. Allocated memory was 230.7MB in the beginning and 357.6MB in the end (delta: 126.9MB). Free memory was 146.1MB in the beginning and 276.8MB in the end (delta: -130.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 344, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 378, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 44, dependent conditional: 34, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 378, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 378, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 344, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 344, independent: 320, independent conditional: 0, independent unconditional: 320, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 378, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 344, unknown conditional: 0, unknown unconditional: 344] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 334, Positive conditional cache size: 0, Positive unconditional cache size: 334, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 4, Independence queries for same thread: 0 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 32, Times there's more than one choice: 5, Avg number of choices: 1.15625 - StatisticsResult: Reduction benchmarks 0.1s Time before loop, 0.0s Time in loop, 0.1s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, t_fun_#res.base, ~tzname~0.offset, old(~tzname~0.offset), write~int_#ptr.base, ~timezone~0, old(~timezone~0), ULTIMATE.start_main_#t~mem19#1, t_funThread1of1ForFork0_#res.offset, ~__daylight~0, old(~__daylight~0), ULTIMATE.start_main_#res#1, ~#A~0.offset, old(~#A~0.offset), ULTIMATE.start___VERIFIER_assert_~cond#1, read~int_#ptr.base, #PthreadsMutexLock_#inputPtr.offset, ULTIMATE.start_#t~ret20#1, t_funThread1of1ForFork0_#in~arg.offset, ~#A~0.base, old(~#A~0.base), ~#C~0.offset, old(~#C~0.offset), #Ultimate.allocOnStack_~size, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, ~daylight~0, old(~daylight~0), ~tzname~0.base, old(~tzname~0.base), ~#C~0.base, old(~#C~0.base), t_fun_~arg.base, t_fun_#in~arg.base, #PthreadsMutexUnlock_#inputPtr.base, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, ~__tzname~0.offset, old(~__tzname~0.offset), write~int_#value, write~init~int_#ptr.offset, t_funThread1of1ForFork0_~arg.offset, ULTIMATE.dealloc_~addr.base, t_fun_#t~nondet1, t_fun_#t~nondet2, t_fun_#t~nondet3, t_fun_#t~nondet4, t_fun_#t~nondet5, t_fun_#t~nondet6, t_fun_#t~nondet7, t_fun_#t~nondet8, #pthreadsForks, old(#pthreadsForks), ULTIMATE.start_main_~#id~0#1.offset, t_fun_#res.offset, t_funThread1of1ForFork0_thidvar0, old(t_funThread1of1ForFork0_thidvar0), t_funThread1of1ForFork0_thidvar1, old(t_funThread1of1ForFork0_thidvar1), ~g~0, old(~g~0), #valid, old(#valid), #pthreadsMutex, old(#pthreadsMutex), read~int_#value, t_funThread1of1ForFork0_#res.base, #Ultimate.allocInit_~size, #PthreadsMutexLock_#inputPtr.base, write~init~int_#ptr.base, #PthreadsMutexUnlock_#res, t_fun_#in~arg.offset, ~#B~0.offset, old(~#B~0.offset), #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet18#1, #length, old(#length), write~int_#sizeOfWrittenType, #StackHeapBarrier, old(#StackHeapBarrier), ~#B~0.base, old(~#B~0.base), ~__timezone~0, old(~__timezone~0), #PthreadsMutexLock_#res, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre9#1, ~__tzname~0.base, old(~__tzname~0.base), ULTIMATE.start___VERIFIER_assert_#in~cond#1, #memory_int, old(#memory_int), t_fun_~arg.offset, #Ultimate.allocOnStack_#res.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#in~arg.base, ULTIMATE.start_main_~#id~0#1.base, read~int_#ptr.offset, #PthreadsMutexUnlock_#inputPtr.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_#t~nondet4, t_funThread1of1ForFork0_#t~nondet5, t_funThread1of1ForFork0_#t~nondet6, t_funThread1of1ForFork0_#t~nondet7, t_funThread1of1ForFork0_#t~nondet8], Protected Variables before encountering a loop: [ULTIMATE.start___VERIFIER_assert_~cond#1, ~#A~0.base, ~#C~0.offset, ~#C~0.base, ~g~0, #pthreadsMutex, ~#B~0.offset, ~#B~0.base, ULTIMATE.start___VERIFIER_assert_#in~cond#1] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2147, independent: 2042, independent conditional: 2042, independent unconditional: 0, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2135, independent: 2042, independent conditional: 2042, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2135, independent: 2042, independent conditional: 2042, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2518, independent: 2042, independent conditional: 0, independent unconditional: 2042, dependent: 476, dependent conditional: 383, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2518, independent: 2042, independent conditional: 0, independent unconditional: 2042, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2518, independent: 2042, independent conditional: 0, independent unconditional: 2042, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2135, independent: 2042, independent conditional: 0, independent unconditional: 2042, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2135, independent: 1986, independent conditional: 0, independent unconditional: 1986, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 149, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 149, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2518, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 383, dependent conditional: 0, dependent unconditional: 383, unknown: 2135, unknown conditional: 0, unknown unconditional: 2135] , Statistics on independence cache: Total cache size (in pairs): 2135, Positive cache size: 2042, Positive conditional cache size: 0, Positive unconditional cache size: 2042, Negative cache size: 93, Negative conditional cache size: 0, Negative unconditional cache size: 93, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 383, Maximal queried relation: 5, Independence queries for same thread: 12 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 4, RedundantProofs: 1, ProvenStates: 163, Times there's more than one choice: 16, Avg number of choices: 1.116564417177914 - StatisticsResult: Reduction benchmarks 0.1s Time before loop, 0.8s Time in loop, 0.9s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, t_fun_#res.base, ~tzname~0.offset, old(~tzname~0.offset), write~int_#ptr.base, ~timezone~0, old(~timezone~0), ULTIMATE.start_main_#t~mem19#1, t_funThread1of1ForFork0_#res.offset, ~__daylight~0, old(~__daylight~0), ULTIMATE.start_main_#res#1, ~#A~0.offset, old(~#A~0.offset), ULTIMATE.start___VERIFIER_assert_~cond#1, read~int_#ptr.base, #PthreadsMutexLock_#inputPtr.offset, ULTIMATE.start_#t~ret20#1, t_funThread1of1ForFork0_#in~arg.offset, ~#A~0.base, old(~#A~0.base), ~#C~0.offset, old(~#C~0.offset), #Ultimate.allocOnStack_~size, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, ~daylight~0, old(~daylight~0), ~tzname~0.base, old(~tzname~0.base), ~#C~0.base, old(~#C~0.base), t_fun_~arg.base, t_fun_#in~arg.base, #PthreadsMutexUnlock_#inputPtr.base, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, ~__tzname~0.offset, old(~__tzname~0.offset), write~int_#value, write~init~int_#ptr.offset, t_funThread1of1ForFork0_~arg.offset, ULTIMATE.dealloc_~addr.base, t_fun_#t~nondet1, t_fun_#t~nondet2, t_fun_#t~nondet3, t_fun_#t~nondet4, t_fun_#t~nondet5, t_fun_#t~nondet6, t_fun_#t~nondet7, t_fun_#t~nondet8, #pthreadsForks, old(#pthreadsForks), ULTIMATE.start_main_~#id~0#1.offset, t_fun_#res.offset, t_funThread1of1ForFork0_thidvar0, old(t_funThread1of1ForFork0_thidvar0), t_funThread1of1ForFork0_thidvar1, old(t_funThread1of1ForFork0_thidvar1), ~g~0, old(~g~0), #valid, old(#valid), #pthreadsMutex, old(#pthreadsMutex), read~int_#value, t_funThread1of1ForFork0_#res.base, #Ultimate.allocInit_~size, #PthreadsMutexLock_#inputPtr.base, write~init~int_#ptr.base, #PthreadsMutexUnlock_#res, t_fun_#in~arg.offset, ~#B~0.offset, old(~#B~0.offset), #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet18#1, #length, old(#length), write~int_#sizeOfWrittenType, #StackHeapBarrier, old(#StackHeapBarrier), ~#B~0.base, old(~#B~0.base), ~__timezone~0, old(~__timezone~0), #PthreadsMutexLock_#res, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre9#1, ~__tzname~0.base, old(~__tzname~0.base), ULTIMATE.start___VERIFIER_assert_#in~cond#1, #memory_int, old(#memory_int), t_fun_~arg.offset, #Ultimate.allocOnStack_#res.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#in~arg.base, ULTIMATE.start_main_~#id~0#1.base, read~int_#ptr.offset, #PthreadsMutexUnlock_#inputPtr.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_#t~nondet4, t_funThread1of1ForFork0_#t~nondet5, t_funThread1of1ForFork0_#t~nondet6, t_funThread1of1ForFork0_#t~nondet7, t_funThread1of1ForFork0_#t~nondet8], Protected Variables before encountering a loop: [~#A~0.offset, ULTIMATE.start___VERIFIER_assert_~cond#1, ~#A~0.base, ~#C~0.base, ~g~0, #pthreadsMutex, ~#B~0.base, ULTIMATE.start___VERIFIER_assert_#in~cond#1] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.0s Time in loop, 0.0s Time in total, Has Loop: false, Protected Variables: [], Protected Variables before encountering a loop: [] - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 126 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.6s, 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: 23, 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.7s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 126 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.6s, 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: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 1056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 126 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-25 23:20:16,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-01-25 23:20:16,355 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-01-25 23:20:16,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-01-25 23:20:16,758 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...