/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 15:21:19,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 15:21:19,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 15:21:19,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 15:21:19,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 15:21:19,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 15:21:19,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 15:21:19,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 15:21:19,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 15:21:19,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 15:21:19,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 15:21:19,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 15:21:19,253 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 15:21:19,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 15:21:19,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 15:21:19,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 15:21:19,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 15:21:19,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 15:21:19,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 15:21:19,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 15:21:19,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 15:21:19,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 15:21:19,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 15:21:19,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 15:21:19,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 15:21:19,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 15:21:19,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 15:21:19,256 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 15:21:19,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 15:21:19,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 15:21:19,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 15:21:19,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 15:21:19,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 15:21:19,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 15:21:19,257 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 15:21:19,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 15:21:19,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 15:21:19,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 15:21:19,258 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 15:21:19,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 15:21:19,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 15:21:19,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 15:21:19,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 15:21:19,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 15:21:19,509 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 15:21:19,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_tso.i [2024-05-06 15:21:20,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 15:21:20,627 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 15:21:20,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_tso.i [2024-05-06 15:21:20,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0a958cfbc/ffe8367f02f04a059017b51c145f657e/FLAG0cbcb02ab [2024-05-06 15:21:20,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0a958cfbc/ffe8367f02f04a059017b51c145f657e [2024-05-06 15:21:20,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 15:21:20,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 15:21:20,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 15:21:20,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 15:21:20,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 15:21:20,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:21:20" (1/1) ... [2024-05-06 15:21:20,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e734e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:20, skipping insertion in model container [2024-05-06 15:21:20,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:21:20" (1/1) ... [2024-05-06 15:21:20,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 15:21:20,824 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_tso.i[945,958] [2024-05-06 15:21:20,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 15:21:20,979 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 15:21:20,991 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_tso.i[945,958] [2024-05-06 15:21:21,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 15:21:21,044 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 15:21:21,045 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 15:21:21,050 INFO L206 MainTranslator]: Completed translation [2024-05-06 15:21:21,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21 WrapperNode [2024-05-06 15:21:21,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 15:21:21,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 15:21:21,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 15:21:21,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 15:21:21,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,090 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-05-06 15:21:21,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 15:21:21,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 15:21:21,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 15:21:21,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 15:21:21,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 15:21:21,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 15:21:21,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 15:21:21,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 15:21:21,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (1/1) ... [2024-05-06 15:21:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 15:21:21,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 15:21:21,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 15:21:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 15:21:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 15:21:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 15:21:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 15:21:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 15:21:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 15:21:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 15:21:21,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 15:21:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 15:21:21,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 15:21:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 15:21:21,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 15:21:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 15:21:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 15:21:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 15:21:21,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 15:21:21,208 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 15:21:21,320 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 15:21:21,323 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 15:21:21,444 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 15:21:21,451 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 15:21:21,452 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 15:21:21,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:21:21 BoogieIcfgContainer [2024-05-06 15:21:21,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 15:21:21,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 15:21:21,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 15:21:21,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 15:21:21,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 03:21:20" (1/3) ... [2024-05-06 15:21:21,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269937bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:21:21, skipping insertion in model container [2024-05-06 15:21:21,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:21:21" (2/3) ... [2024-05-06 15:21:21,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269937bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:21:21, skipping insertion in model container [2024-05-06 15:21:21,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:21:21" (3/3) ... [2024-05-06 15:21:21,459 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_tso.i [2024-05-06 15:21:21,465 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 15:21:21,473 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 15:21:21,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 15:21:21,473 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 15:21:21,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 15:21:21,546 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 15:21:21,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 15:21:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 15:21:21,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 15:21:21,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 15:21:21,596 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 15:21:21,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:21:21,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 15:21:21,614 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d0b09f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 15:21:21,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 15:21:21,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 15:21:21,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:21:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1765759485, now seen corresponding path program 1 times [2024-05-06 15:21:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:21:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987339902] [2024-05-06 15:21:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:21:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987339902] [2024-05-06 15:21:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987339902] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:21:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:21:21,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 15:21:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830832800] [2024-05-06 15:21:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:21:21,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 15:21:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:21:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 15:21:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 15:21:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:22,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:21:22,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 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-05-06 15:21:22,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:22,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:22,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 15:21:22,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 15:21:22,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:21:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1974142207, now seen corresponding path program 1 times [2024-05-06 15:21:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:21:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053011986] [2024-05-06 15:21:22,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:21:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053011986] [2024-05-06 15:21:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053011986] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:21:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:21:22,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 15:21:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292124822] [2024-05-06 15:21:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:21:22,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 15:21:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:21:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 15:21:22,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 15:21:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:22,513 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:21:22,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 15:21:22,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:22,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691819, now seen corresponding path program 1 times [2024-05-06 15:21:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 15:21:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-06 15:21:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 1 times [2024-05-06 15:21:23,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:23,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 15:21:23,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 15:21:23,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 15:21:23,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:21:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1987989425, now seen corresponding path program 1 times [2024-05-06 15:21:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:21:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93522573] [2024-05-06 15:21:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:21:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93522573] [2024-05-06 15:21:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93522573] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:21:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:21:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 15:21:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007063211] [2024-05-06 15:21:23,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:21:23,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 15:21:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:21:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 15:21:23,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 15:21:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:23,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:21:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 15:21:23,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:23,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-06 15:21:23,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 2 times [2024-05-06 15:21:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:23,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 361471003, now seen corresponding path program 1 times [2024-05-06 15:21:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -420384456, now seen corresponding path program 1 times [2024-05-06 15:21:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1438000536, now seen corresponding path program 1 times [2024-05-06 15:21:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 15:21:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-06 15:21:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 3 times [2024-05-06 15:21:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 361471003, now seen corresponding path program 2 times [2024-05-06 15:21:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash -420384456, now seen corresponding path program 2 times [2024-05-06 15:21:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:24,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2036241017, now seen corresponding path program 4 times [2024-05-06 15:21:25,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:25,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash 204231963, now seen corresponding path program 3 times [2024-05-06 15:21:26,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:26,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash 422229592, now seen corresponding path program 3 times [2024-05-06 15:21:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:26,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1358292246, now seen corresponding path program 1 times [2024-05-06 15:21:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:27,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash 691520574, now seen corresponding path program 1 times [2024-05-06 15:21:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:27,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:27,429 INFO L85 PathProgramCache]: Analyzing trace with hash 282998965, now seen corresponding path program 1 times [2024-05-06 15:21:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:27,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:27,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash -617124170, now seen corresponding path program 2 times [2024-05-06 15:21:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:28,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash 534281534, now seen corresponding path program 2 times [2024-05-06 15:21:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:28,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1125613013, now seen corresponding path program 2 times [2024-05-06 15:21:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:28,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1279517592, now seen corresponding path program 1 times [2024-05-06 15:21:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:29,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 550432124, now seen corresponding path program 1 times [2024-05-06 15:21:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:29,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1522667593, now seen corresponding path program 1 times [2024-05-06 15:21:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:29,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:30,699 INFO L85 PathProgramCache]: Analyzing trace with hash -695898824, now seen corresponding path program 2 times [2024-05-06 15:21:30,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:30,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash 393193084, now seen corresponding path program 2 times [2024-05-06 15:21:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:30,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -680053545, now seen corresponding path program 2 times [2024-05-06 15:21:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:30,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash 756759680, now seen corresponding path program 1 times [2024-05-06 15:21:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:33,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:35,259 INFO L85 PathProgramCache]: Analyzing trace with hash -153703577, now seen corresponding path program 1 times [2024-05-06 15:21:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:35,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1839337294, now seen corresponding path program 1 times [2024-05-06 15:21:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:35,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 15:21:35,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-05-06 15:21:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash 756759680, now seen corresponding path program 2 times [2024-05-06 15:21:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:36,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash -153703577, now seen corresponding path program 2 times [2024-05-06 15:21:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2083167826, now seen corresponding path program 1 times [2024-05-06 15:21:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1318277113, now seen corresponding path program 1 times [2024-05-06 15:21:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash 42525590, now seen corresponding path program 1 times [2024-05-06 15:21:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2079583661, now seen corresponding path program 1 times [2024-05-06 15:21:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 344178685, now seen corresponding path program 1 times [2024-05-06 15:21:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2089313445, now seen corresponding path program 1 times [2024-05-06 15:21:37,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash 344493262, now seen corresponding path program 1 times [2024-05-06 15:21:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1089358996, now seen corresponding path program 1 times [2024-05-06 15:21:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:37,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 450782945, now seen corresponding path program 1 times [2024-05-06 15:21:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1232381850, now seen corresponding path program 1 times [2024-05-06 15:21:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash 375888265, now seen corresponding path program 1 times [2024-05-06 15:21:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 289221978, now seen corresponding path program 1 times [2024-05-06 15:21:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2087540400, now seen corresponding path program 1 times [2024-05-06 15:21:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash 344435602, now seen corresponding path program 1 times [2024-05-06 15:21:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1396585537, now seen corresponding path program 1 times [2024-05-06 15:21:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -553310899, now seen corresponding path program 1 times [2024-05-06 15:21:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:21:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 15:21:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 15:21:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-05-06 15:21:41,572 INFO L85 PathProgramCache]: Analyzing trace with hash -153703577, now seen corresponding path program 3 times [2024-05-06 15:21:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2083167826, now seen corresponding path program 2 times [2024-05-06 15:21:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1318277113, now seen corresponding path program 2 times [2024-05-06 15:21:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:41,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash 42525590, now seen corresponding path program 2 times [2024-05-06 15:21:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2079583661, now seen corresponding path program 2 times [2024-05-06 15:21:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:41,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 344178685, now seen corresponding path program 2 times [2024-05-06 15:21:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2089313445, now seen corresponding path program 2 times [2024-05-06 15:21:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash 344493262, now seen corresponding path program 2 times [2024-05-06 15:21:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1089358996, now seen corresponding path program 2 times [2024-05-06 15:21:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 450782945, now seen corresponding path program 2 times [2024-05-06 15:21:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1232381850, now seen corresponding path program 2 times [2024-05-06 15:21:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 375888265, now seen corresponding path program 2 times [2024-05-06 15:21:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 289221978, now seen corresponding path program 2 times [2024-05-06 15:21:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2087540400, now seen corresponding path program 2 times [2024-05-06 15:21:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash 344435602, now seen corresponding path program 2 times [2024-05-06 15:21:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1396585537, now seen corresponding path program 2 times [2024-05-06 15:21:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:42,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,594 INFO L85 PathProgramCache]: Analyzing trace with hash -974713489, now seen corresponding path program 1 times [2024-05-06 15:21:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash -31113678, now seen corresponding path program 1 times [2024-05-06 15:21:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1525669377, now seen corresponding path program 1 times [2024-05-06 15:21:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1889940070, now seen corresponding path program 1 times [2024-05-06 15:21:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1028978891, now seen corresponding path program 1 times [2024-05-06 15:21:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1279462463, now seen corresponding path program 1 times [2024-05-06 15:21:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2118588243, now seen corresponding path program 1 times [2024-05-06 15:21:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:44,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash -482641966, now seen corresponding path program 1 times [2024-05-06 15:21:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1026694209, now seen corresponding path program 2 times [2024-05-06 15:21:45,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -659617896, now seen corresponding path program 1 times [2024-05-06 15:21:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -649415920, now seen corresponding path program 2 times [2024-05-06 15:21:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1087429353, now seen corresponding path program 1 times [2024-05-06 15:21:45,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1169665967, now seen corresponding path program 2 times [2024-05-06 15:21:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1284656746, now seen corresponding path program 1 times [2024-05-06 15:21:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1300399848, now seen corresponding path program 2 times [2024-05-06 15:21:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1897714671, now seen corresponding path program 1 times [2024-05-06 15:21:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1841336645, now seen corresponding path program 2 times [2024-05-06 15:21:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1741716958, now seen corresponding path program 1 times [2024-05-06 15:21:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1762077665, now seen corresponding path program 2 times [2024-05-06 15:21:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash 472482808, now seen corresponding path program 1 times [2024-05-06 15:21:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash 500231683, now seen corresponding path program 2 times [2024-05-06 15:21:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -538053226, now seen corresponding path program 1 times [2024-05-06 15:21:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -496451536, now seen corresponding path program 2 times [2024-05-06 15:21:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2094224951, now seen corresponding path program 1 times [2024-05-06 15:21:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:21:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:21:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:45,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:21:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:21:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:21:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 15:21:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-06 15:21:46,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 15:21:46,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 15:21:46,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 15:21:46,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 15:21:46,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable76,SelfDestructingSolverStorable33,SelfDestructingSolverStorable77,SelfDestructingSolverStorable34,SelfDestructingSolverStorable78,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable79,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable40,SelfDestructingSolverStorable84,SelfDestructingSolverStorable41,SelfDestructingSolverStorable85,SelfDestructingSolverStorable42,SelfDestructingSolverStorable86,SelfDestructingSolverStorable43,SelfDestructingSolverStorable87,SelfDestructingSolverStorable44,SelfDestructingSolverStorable88,SelfDestructingSolverStorable45,SelfDestructingSolverStorable89,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 15:21:46,069 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 15:21:46,071 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 15:21:46,071 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 15:21:46,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 03:21:46 BasicIcfg [2024-05-06 15:21:46,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 15:21:46,074 INFO L158 Benchmark]: Toolchain (without parser) took 25422.85ms. Allocated memory was 250.6MB in the beginning and 1.1GB in the end (delta: 857.7MB). Free memory was 175.1MB in the beginning and 835.4MB in the end (delta: -660.3MB). Peak memory consumption was 197.8MB. Max. memory is 8.0GB. [2024-05-06 15:21:46,074 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 250.6MB. Free memory is still 218.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 15:21:46,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.06ms. Allocated memory is still 250.6MB. Free memory was 174.9MB in the beginning and 154.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-06 15:21:46,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 250.6MB. Free memory was 154.3MB in the beginning and 152.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 15:21:46,075 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 250.6MB. Free memory was 152.2MB in the beginning and 150.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 15:21:46,075 INFO L158 Benchmark]: RCFGBuilder took 324.77ms. Allocated memory is still 250.6MB. Free memory was 150.6MB in the beginning and 135.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-06 15:21:46,075 INFO L158 Benchmark]: TraceAbstraction took 24618.78ms. Allocated memory was 250.6MB in the beginning and 1.1GB in the end (delta: 857.7MB). Free memory was 134.7MB in the beginning and 835.4MB in the end (delta: -700.7MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. [2024-05-06 15:21:46,076 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 250.6MB. Free memory is still 218.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 399.06ms. Allocated memory is still 250.6MB. Free memory was 174.9MB in the beginning and 154.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 250.6MB. Free memory was 154.3MB in the beginning and 152.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 250.6MB. Free memory was 152.2MB in the beginning and 150.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 324.77ms. Allocated memory is still 250.6MB. Free memory was 150.6MB in the beginning and 135.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 24618.78ms. Allocated memory was 250.6MB in the beginning and 1.1GB in the end (delta: 857.7MB). Free memory was 134.7MB in the beginning and 835.4MB in the end (delta: -700.7MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 267016, independent: 263593, independent conditional: 263443, independent unconditional: 150, dependent: 3423, dependent conditional: 3423, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266736, independent: 263593, independent conditional: 263443, independent unconditional: 150, dependent: 3143, dependent conditional: 3143, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266736, independent: 263593, independent conditional: 263443, independent unconditional: 150, dependent: 3143, dependent conditional: 3143, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266736, independent: 263593, independent conditional: 263443, independent unconditional: 150, dependent: 3143, dependent conditional: 3143, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276880, independent: 263593, independent conditional: 127841, independent unconditional: 135752, dependent: 13287, dependent conditional: 10032, dependent unconditional: 3255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276880, independent: 263593, independent conditional: 43369, independent unconditional: 220224, dependent: 13287, dependent conditional: 3887, dependent unconditional: 9400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276880, independent: 263593, independent conditional: 43369, independent unconditional: 220224, dependent: 13287, dependent conditional: 3887, dependent unconditional: 9400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1290, independent: 1236, independent conditional: 224, independent unconditional: 1012, dependent: 54, dependent conditional: 30, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1290, independent: 1189, independent conditional: 0, independent unconditional: 1189, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 47, independent conditional: 43, independent unconditional: 4, dependent: 54, dependent conditional: 30, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 47, independent conditional: 43, independent unconditional: 4, dependent: 54, dependent conditional: 30, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 137, independent: 57, independent conditional: 54, independent unconditional: 2, dependent: 80, dependent conditional: 57, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276880, independent: 262357, independent conditional: 43145, independent unconditional: 219212, dependent: 13233, dependent conditional: 3857, dependent unconditional: 9376, unknown: 1290, unknown conditional: 254, unknown unconditional: 1036] , Statistics on independence cache: Total cache size (in pairs): 1290, Positive cache size: 1236, Positive conditional cache size: 224, Positive unconditional cache size: 1012, Negative cache size: 54, Negative conditional cache size: 30, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90617, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276880, independent: 263593, independent conditional: 127841, independent unconditional: 135752, dependent: 13287, dependent conditional: 10032, dependent unconditional: 3255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276880, independent: 263593, independent conditional: 43369, independent unconditional: 220224, dependent: 13287, dependent conditional: 3887, dependent unconditional: 9400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276880, independent: 263593, independent conditional: 43369, independent unconditional: 220224, dependent: 13287, dependent conditional: 3887, dependent unconditional: 9400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1290, independent: 1236, independent conditional: 224, independent unconditional: 1012, dependent: 54, dependent conditional: 30, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1290, independent: 1189, independent conditional: 0, independent unconditional: 1189, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 47, independent conditional: 43, independent unconditional: 4, dependent: 54, dependent conditional: 30, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 47, independent conditional: 43, independent unconditional: 4, dependent: 54, dependent conditional: 30, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 137, independent: 57, independent conditional: 54, independent unconditional: 2, dependent: 80, dependent conditional: 57, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276880, independent: 262357, independent conditional: 43145, independent unconditional: 219212, dependent: 13233, dependent conditional: 3857, dependent unconditional: 9376, unknown: 1290, unknown conditional: 254, unknown unconditional: 1036] , Statistics on independence cache: Total cache size (in pairs): 1290, Positive cache size: 1236, Positive conditional cache size: 224, Positive unconditional cache size: 1012, Negative cache size: 54, Negative conditional cache size: 30, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90617 ], Independence queries for same thread: 280 - PositiveResult [Line: 18]: 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 with 1 thread instances CFG has 7 procedures, 118 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 23.5s, 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: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 802 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, ConditionalCommutativityCheckTime: 20.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 4, ConditionalCommutativityConditionCalculations: 461, ConditionalCommutativityTraceChecks: 85, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 15:21:46,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 15:21:46,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...