/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_29-multiple-protecting2-vesal_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-25 23:19:29,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-25 23:19:29,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-25 23:19:29,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-25 23:19:29,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-25 23:19:29,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-25 23:19:29,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-25 23:19:29,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-25 23:19:29,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-25 23:19:29,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-25 23:19:29,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-25 23:19:29,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-25 23:19:29,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-25 23:19:29,960 INFO L153 SettingsManager]: * Use SBE=true [2024-01-25 23:19:29,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-25 23:19:29,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-25 23:19:29,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-25 23:19:29,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-25 23:19:29,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-25 23:19:29,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-25 23:19:29,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-25 23:19:29,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-25 23:19:29,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-25 23:19:29,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-25 23:19:29,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-25 23:19:29,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-25 23:19:29,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-25 23:19:29,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-25 23:19:29,963 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-25 23:19:29,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-25 23:19:29,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:19:29,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-25 23:19:29,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-25 23:19:29,964 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-25 23:19:29,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-25 23:19:29,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-25 23:19:29,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-25 23:19:29,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-25 23:19:29,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-25 23:19:29,965 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-25 23:19:29,965 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-25 23:19:29,965 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:19:30,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-25 23:19:30,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-25 23:19:30,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-25 23:19:30,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-25 23:19:30,174 INFO L274 PluginConnector]: CDTParser initialized [2024-01-25 23:19:30,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2024-01-25 23:19:31,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-25 23:19:31,288 INFO L384 CDTParser]: Found 1 translation units. [2024-01-25 23:19:31,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2024-01-25 23:19:31,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ccd39b5ca/192ad425c27046de8a8d0b90d25d1ee3/FLAGcb1f264c4 [2024-01-25 23:19:31,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ccd39b5ca/192ad425c27046de8a8d0b90d25d1ee3 [2024-01-25 23:19:31,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-25 23:19:31,313 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-25 23:19:31,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-25 23:19:31,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-25 23:19:31,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-25 23:19:31,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ea5689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31, skipping insertion in model container [2024-01-25 23:19:31,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,363 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-25 23:19:31,501 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2024-01-25 23:19:31,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:19:31,628 INFO L202 MainTranslator]: Completed pre-run [2024-01-25 23:19:31,637 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2024-01-25 23:19:31,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:19:31,704 INFO L206 MainTranslator]: Completed translation [2024-01-25 23:19:31,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31 WrapperNode [2024-01-25 23:19:31,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-25 23:19:31,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-25 23:19:31,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-25 23:19:31,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-25 23:19:31,710 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:19:31" (1/1) ... [2024-01-25 23:19:31,719 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:19:31" (1/1) ... [2024-01-25 23:19:31,735 INFO L138 Inliner]: procedures = 163, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2024-01-25 23:19:31,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-25 23:19:31,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-25 23:19:31,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-25 23:19:31,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-25 23:19:31,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-25 23:19:31,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-25 23:19:31,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-25 23:19:31,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-25 23:19:31,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (1/1) ... [2024-01-25 23:19:31,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:19:31,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:19:31,782 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:19:31,801 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:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-01-25 23:19:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-25 23:19:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-25 23:19:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-25 23:19:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-25 23:19:31,807 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:19:31,934 INFO L241 CfgBuilder]: Building ICFG [2024-01-25 23:19:31,936 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-25 23:19:32,097 INFO L282 CfgBuilder]: Performing block encoding [2024-01-25 23:19:32,122 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-25 23:19:32,123 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-25 23:19:32,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:19:32 BoogieIcfgContainer [2024-01-25 23:19:32,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-25 23:19:32,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-25 23:19:32,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-25 23:19:32,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-25 23:19:32,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 11:19:31" (1/3) ... [2024-01-25 23:19:32,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ffa6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:19:32, skipping insertion in model container [2024-01-25 23:19:32,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:19:31" (2/3) ... [2024-01-25 23:19:32,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ffa6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:19:32, skipping insertion in model container [2024-01-25 23:19:32,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:19:32" (3/3) ... [2024-01-25 23:19:32,129 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2024-01-25 23:19:32,135 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-25 23:19:32,141 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-25 23:19:32,142 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-01-25 23:19:32,144 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-25 23:19:32,200 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-25 23:19:32,234 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:32,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:19:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:19:32,235 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:19:32,237 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:19:32,263 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:19:32,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:19:32,274 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;@6e1b7743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:32,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-25 23:19:32,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:32,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 900040802, now seen corresponding path program 1 times [2024-01-25 23:19:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:32,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147307438] [2024-01-25 23:19:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:32,693 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:19:32,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:32,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147307438] [2024-01-25 23:19:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147307438] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:32,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:19:32,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904007056] [2024-01-25 23:19:32,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:32,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:19:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:19:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:19:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:32,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:32,718 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:19:32,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:32,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-25 23:19:32,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:32,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1878728702, now seen corresponding path program 1 times [2024-01-25 23:19:32,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5820735] [2024-01-25 23:19:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:33,050 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:19:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5820735] [2024-01-25 23:19:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5820735] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:33,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-25 23:19:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817387352] [2024-01-25 23:19:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:33,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-25 23:19:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-25 23:19:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-25 23:19:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:33,053 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:33,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:19:33,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:33,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-25 23:19:33,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-25 23:19:33,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:33,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1764033371, now seen corresponding path program 1 times [2024-01-25 23:19:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144687442] [2024-01-25 23:19:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:33,585 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:19:33,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:33,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144687442] [2024-01-25 23:19:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144687442] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:33,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:33,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-25 23:19:33,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705589375] [2024-01-25 23:19:33,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:33,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-25 23:19:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-25 23:19:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-01-25 23:19:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:33,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:33,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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:19:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-01-25 23:19:33,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-25 23:19:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:19:33,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:19:33,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-25 23:19:33,945 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-01-25 23:19:33,946 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/4) [2024-01-25 23:19:33,949 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:33,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:19:33,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:19:33,987 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:19:33,990 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:19:33,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:19:33,991 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;@6e1b7743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:33,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:19:33,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:33,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 612569832, now seen corresponding path program 1 times [2024-01-25 23:19:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446470972] [2024-01-25 23:19:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:33,998 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:19:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:34,014 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:19:34,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446470972] [2024-01-25 23:19:34,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446470972] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:34,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:34,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:19:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391891856] [2024-01-25 23:19:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:34,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:19:34,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:34,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:19:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:19:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:34,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 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:19:34,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-25 23:19:34,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:34,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -796853019, now seen corresponding path program 1 times [2024-01-25 23:19:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203334720] [2024-01-25 23:19:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:34,125 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:19:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203334720] [2024-01-25 23:19:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203334720] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:19:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864797975] [2024-01-25 23:19:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:19:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:19:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:19:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:34,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:19:34,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-25 23:19:34,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-25 23:19:34,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:34,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -535323045, now seen corresponding path program 1 times [2024-01-25 23:19:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:34,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646545736] [2024-01-25 23:19:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:34,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:34,318 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:19:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646545736] [2024-01-25 23:19:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646545736] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:34,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-25 23:19:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880111883] [2024-01-25 23:19:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:34,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-25 23:19:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:34,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-25 23:19:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-25 23:19:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,320 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:34,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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:19:34,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-25 23:19:34,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-25 23:19:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-25 23:19:34,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-25 23:19:34,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:34,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash 338156318, now seen corresponding path program 1 times [2024-01-25 23:19:34,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:34,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209419044] [2024-01-25 23:19:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:34,624 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:19:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209419044] [2024-01-25 23:19:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209419044] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:34,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:34,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-25 23:19:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762416274] [2024-01-25 23:19:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:34,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-25 23:19:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-25 23:19:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-01-25 23:19:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:34,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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:19:34,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:34,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-25 23:19:34,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-01-25 23:19:34,627 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 [2024-01-25 23:19:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-25 23:19:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-25 23:19:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-01-25 23:19:36,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:19:36,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-25 23:19:36,934 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-01-25 23:19:36,935 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/4) [2024-01-25 23:19:36,936 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:19:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:19:36,938 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:19:36,946 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:19:36,948 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:19:36,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:19:36,949 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;@6e1b7743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:36,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:19:36,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:36,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1868755042, now seen corresponding path program 1 times [2024-01-25 23:19:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:36,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559564311] [2024-01-25 23:19:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:36,972 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:19:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:36,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559564311] [2024-01-25 23:19:36,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559564311] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:36,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:19:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865275812] [2024-01-25 23:19:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:36,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:19:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:36,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:19:36,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:19:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:36,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:36,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 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:19:36,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-25 23:19:37,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:37,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -636600175, now seen corresponding path program 1 times [2024-01-25 23:19:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421428921] [2024-01-25 23:19:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:37,100 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:19:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421428921] [2024-01-25 23:19:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421428921] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:19:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829088563] [2024-01-25 23:19:37,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:37,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:19:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:37,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:19:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:19:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,102 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:37,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:19:37,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:37,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-25 23:19:37,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:37,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1790702593, now seen corresponding path program 1 times [2024-01-25 23:19:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:37,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504462732] [2024-01-25 23:19:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:37,297 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:19:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:37,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504462732] [2024-01-25 23:19:37,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504462732] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:37,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:37,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:19:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861421860] [2024-01-25 23:19:37,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:37,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:19:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:37,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:19:37,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:19:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,298 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:37,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:19:37,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:37,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:19:37,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-25 23:19:37,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:19:37,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:19:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 74654536, now seen corresponding path program 1 times [2024-01-25 23:19:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:19:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619309378] [2024-01-25 23:19:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:19:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:19:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:19:37,474 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:19:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:19:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619309378] [2024-01-25 23:19:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619309378] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:19:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:19:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-25 23:19:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198284371] [2024-01-25 23:19:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:19:37,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-25 23:19:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:19:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-25 23:19:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-01-25 23:19:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,475 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:19:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:19:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:19:37,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:19:37,475 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 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:19:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:19:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-25 23:19:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-25 23:19:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-25 23:19:52,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:19:52,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-25 23:19:52,096 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-01-25 23:19:52,096 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/4) [2024-01-25 23:19:52,097 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:52,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:19:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:19:52,099 INFO L229 MonitoredProcess]: Starting monitored process 5 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:19:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-01-25 23:19:52,120 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:19:52,120 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-25 23:19:52,121 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;@6e1b7743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:19:52,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-25 23:19:52,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-25 23:19:52,122 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-01-25 23:19:52,122 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (4/4) [2024-01-25 23:19:52,123 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-25 23:19:52,123 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-25 23:19:52,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 11:19:52 BasicIcfg [2024-01-25 23:19:52,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-25 23:19:52,126 INFO L158 Benchmark]: Toolchain (without parser) took 20812.67ms. Allocated memory was 246.4MB in the beginning and 307.2MB in the end (delta: 60.8MB). Free memory was 191.3MB in the beginning and 230.3MB in the end (delta: -39.0MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2024-01-25 23:19:52,126 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-25 23:19:52,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.19ms. Allocated memory is still 246.4MB. Free memory was 191.3MB in the beginning and 171.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-01-25 23:19:52,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.00ms. Allocated memory is still 246.4MB. Free memory was 170.9MB in the beginning and 168.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-25 23:19:52,127 INFO L158 Benchmark]: Boogie Preprocessor took 16.32ms. Allocated memory is still 246.4MB. Free memory was 168.8MB in the beginning and 167.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-25 23:19:52,127 INFO L158 Benchmark]: RCFGBuilder took 370.98ms. Allocated memory is still 246.4MB. Free memory was 167.7MB in the beginning and 147.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-01-25 23:19:52,127 INFO L158 Benchmark]: TraceAbstraction took 20000.31ms. Allocated memory was 246.4MB in the beginning and 307.2MB in the end (delta: 60.8MB). Free memory was 147.3MB in the beginning and 230.3MB in the end (delta: -83.0MB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-25 23:19:52,128 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.11ms. Allocated memory is still 204.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 389.19ms. Allocated memory is still 246.4MB. Free memory was 191.3MB in the beginning and 171.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.00ms. Allocated memory is still 246.4MB. Free memory was 170.9MB in the beginning and 168.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.32ms. Allocated memory is still 246.4MB. Free memory was 168.8MB in the beginning and 167.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 370.98ms. Allocated memory is still 246.4MB. Free memory was 167.7MB in the beginning and 147.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 20000.31ms. Allocated memory was 246.4MB in the beginning and 307.2MB in the end (delta: 60.8MB). Free memory was 147.3MB in the beginning and 230.3MB in the end (delta: -83.0MB). 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: 462, independent: 457, independent conditional: 457, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 462, independent: 457, independent conditional: 457, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 462, independent: 457, independent conditional: 457, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 473, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 473, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 473, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 473, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 457, Positive conditional cache size: 0, Positive unconditional cache size: 457, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 3, Independence queries for same thread: 0 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 6, Times there's more than one choice: 3, Avg number of choices: 1.6666666666666667 - StatisticsResult: Reduction benchmarks 0.4s Time before loop, 0.0s Time in loop, 0.4s Time in total, Has Loop: false, Protected Variables: [ULTIMATE.start___VERIFIER_assert_~cond#1, ~g2~0, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_#t~post6, ULTIMATE.start___VERIFIER_assert_#in~cond#1], Protected Variables before encountering a loop: [ULTIMATE.start___VERIFIER_assert_~cond#1, ~g2~0, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_#t~post6, ULTIMATE.start___VERIFIER_assert_#in~cond#1] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1819, independent: 1781, independent conditional: 1781, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1802, independent: 1781, independent conditional: 1781, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1802, independent: 1781, independent conditional: 1781, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1882, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 101, dependent conditional: 80, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1882, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1882, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1802, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1802, independent: 1774, independent conditional: 0, independent unconditional: 1774, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1882, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 1802, unknown conditional: 0, unknown unconditional: 1802] , Statistics on independence cache: Total cache size (in pairs): 1802, Positive cache size: 1781, Positive conditional cache size: 0, Positive unconditional cache size: 1781, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 80, Maximal queried relation: 4, Independence queries for same thread: 17 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 4, RedundantProofs: 2, ProvenStates: 39, Times there's more than one choice: 21, Avg number of choices: 2.230769230769231 - StatisticsResult: Reduction benchmarks 0.3s Time before loop, 2.0s Time in loop, 2.3s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ~#__global_lock~0.offset, old(~#__global_lock~0.offset), ULTIMATE.start_main_~#id2~0#1.base, ~tzname~0.offset, old(~tzname~0.offset), write~int_#ptr.base, ~timezone~0, old(~timezone~0), ULTIMATE.start_main_#t~mem19#1, ~#mutex2~0.base, old(~#mutex2~0.base), t2_funThread1of1ForFork0_#t~nondet1, t2_funThread1of1ForFork0_#t~nondet2, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~nondet5, t2_funThread1of1ForFork0_#t~nondet7, t2_funThread1of1ForFork0_#t~nondet8, ~__daylight~0, old(~__daylight~0), ULTIMATE.start_main_#res#1, ULTIMATE.start___VERIFIER_assert_~cond#1, t2_funThread1of1ForFork0_#res.offset, t2_fun_~arg.base, t2_fun_#in~arg.base, read~int_#ptr.base, #PthreadsMutexLock_#inputPtr.offset, ULTIMATE.start_#t~ret20#1, t2_fun_#t~nondet1, t2_fun_#t~nondet2, t2_fun_#t~nondet4, t2_fun_#t~nondet5, t2_fun_#t~nondet7, t2_fun_#t~nondet8, t2_funThread1of1ForFork0_#in~arg.offset, #Ultimate.allocOnStack_~size, t2_fun_#res.offset, ~#mutex1~0.offset, old(~#mutex1~0.offset), read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, ~daylight~0, old(~daylight~0), ~tzname~0.base, old(~tzname~0.base), ~g2~0, old(~g2~0), t2_fun_#in~arg.offset, #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, ULTIMATE.dealloc_~addr.base, ~#mutex1~0.base, old(~#mutex1~0.base), #pthreadsForks, old(#pthreadsForks), t2_funThread1of1ForFork0_~arg.offset, ~#__global_lock~0.base, old(~#__global_lock~0.base), #valid, old(#valid), #pthreadsMutex, old(#pthreadsMutex), read~int_#value, #Ultimate.allocInit_~size, #PthreadsMutexLock_#inputPtr.base, ULTIMATE.start_main_~#id2~0#1.offset, write~init~int_#ptr.base, t2_funThread1of1ForFork0_#res.base, #PthreadsMutexUnlock_#res, t2_fun_~arg.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, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_#t~post6, t2_fun_#res.base, #StackHeapBarrier, old(#StackHeapBarrier), t2_funThread1of1ForFork0_thidvar0, old(t2_funThread1of1ForFork0_thidvar0), t2_funThread1of1ForFork0_thidvar1, old(t2_funThread1of1ForFork0_thidvar1), ~__timezone~0, old(~__timezone~0), #PthreadsMutexLock_#res, ~#mutex2~0.offset, old(~#mutex2~0.offset), 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), t2_fun_#t~post3, t2_fun_#t~post6, #Ultimate.allocOnStack_#res.base, t2_funThread1of1ForFork0_~arg.base, read~int_#ptr.offset, #PthreadsMutexUnlock_#inputPtr.offset, t2_funThread1of1ForFork0_#in~arg.base], Protected Variables before encountering a loop: [ULTIMATE.start___VERIFIER_assert_~cond#1, ~g2~0, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_#t~post6, ULTIMATE.start___VERIFIER_assert_#in~cond#1] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3280, independent: 3166, independent conditional: 3166, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3241, independent: 3166, independent conditional: 3166, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3241, independent: 3166, independent conditional: 3166, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3536, independent: 3166, independent conditional: 0, independent unconditional: 3166, dependent: 370, dependent conditional: 295, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3536, independent: 3166, independent conditional: 0, independent unconditional: 3166, dependent: 370, dependent conditional: 0, dependent unconditional: 370, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3536, independent: 3166, independent conditional: 0, independent unconditional: 3166, dependent: 370, dependent conditional: 0, dependent unconditional: 370, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3241, independent: 3166, independent conditional: 0, independent unconditional: 3166, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3241, independent: 3116, independent conditional: 0, independent unconditional: 3116, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 125, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 125, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3536, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 3241, unknown conditional: 0, unknown unconditional: 3241] , Statistics on independence cache: Total cache size (in pairs): 3241, Positive cache size: 3166, Positive conditional cache size: 0, Positive unconditional cache size: 3166, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 295, Maximal queried relation: 4, Independence queries for same thread: 39 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 4, RedundantProofs: 2, ProvenStates: 129, Times there's more than one choice: 3, Avg number of choices: 1.0232558139534884 - StatisticsResult: Reduction benchmarks 0.1s Time before loop, 14.5s Time in loop, 14.6s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ~#__global_lock~0.offset, old(~#__global_lock~0.offset), ULTIMATE.start_main_~#id2~0#1.base, ~tzname~0.offset, old(~tzname~0.offset), write~int_#ptr.base, ~timezone~0, old(~timezone~0), ULTIMATE.start_main_#t~mem19#1, ~#mutex2~0.base, old(~#mutex2~0.base), t2_funThread1of1ForFork0_#t~nondet1, t2_funThread1of1ForFork0_#t~nondet2, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~nondet5, t2_funThread1of1ForFork0_#t~nondet7, t2_funThread1of1ForFork0_#t~nondet8, ~__daylight~0, old(~__daylight~0), ULTIMATE.start_main_#res#1, ULTIMATE.start___VERIFIER_assert_~cond#1, t2_funThread1of1ForFork0_#res.offset, t2_fun_~arg.base, t2_fun_#in~arg.base, read~int_#ptr.base, #PthreadsMutexLock_#inputPtr.offset, ULTIMATE.start_#t~ret20#1, t2_fun_#t~nondet1, t2_fun_#t~nondet2, t2_fun_#t~nondet4, t2_fun_#t~nondet5, t2_fun_#t~nondet7, t2_fun_#t~nondet8, t2_funThread1of1ForFork0_#in~arg.offset, #Ultimate.allocOnStack_~size, t2_fun_#res.offset, ~#mutex1~0.offset, old(~#mutex1~0.offset), read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, ~daylight~0, old(~daylight~0), ~tzname~0.base, old(~tzname~0.base), ~g2~0, old(~g2~0), t2_fun_#in~arg.offset, #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, ULTIMATE.dealloc_~addr.base, ~#mutex1~0.base, old(~#mutex1~0.base), #pthreadsForks, old(#pthreadsForks), t2_funThread1of1ForFork0_~arg.offset, ~#__global_lock~0.base, old(~#__global_lock~0.base), #valid, old(#valid), #pthreadsMutex, old(#pthreadsMutex), read~int_#value, #Ultimate.allocInit_~size, #PthreadsMutexLock_#inputPtr.base, ULTIMATE.start_main_~#id2~0#1.offset, write~init~int_#ptr.base, t2_funThread1of1ForFork0_#res.base, #PthreadsMutexUnlock_#res, t2_fun_~arg.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, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_#t~post6, t2_fun_#res.base, #StackHeapBarrier, old(#StackHeapBarrier), t2_funThread1of1ForFork0_thidvar0, old(t2_funThread1of1ForFork0_thidvar0), t2_funThread1of1ForFork0_thidvar1, old(t2_funThread1of1ForFork0_thidvar1), ~__timezone~0, old(~__timezone~0), #PthreadsMutexLock_#res, ~#mutex2~0.offset, old(~#mutex2~0.offset), 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), t2_fun_#t~post3, t2_fun_#t~post6, #Ultimate.allocOnStack_#res.base, t2_funThread1of1ForFork0_~arg.base, read~int_#ptr.offset, #PthreadsMutexUnlock_#inputPtr.offset, t2_funThread1of1ForFork0_#in~arg.base], Protected Variables before encountering a loop: [~#mutex2~0.base, ULTIMATE.start___VERIFIER_assert_~cond#1, ~g2~0, ~#__global_lock~0.base, #pthreadsMutex, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_#t~post6, ~#mutex2~0.offset, 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 - 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, 135 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, 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: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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, 135 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.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: 58, 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.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 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.startErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 135 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.8s, 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: 35, 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.3s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 715 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 thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 135 locations, 4 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-25 23:19:52,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-01-25 23:19:52,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-01-25 23:19:52,548 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:19:52,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-01-25 23:19:52,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...