/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-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 13:21:51,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 13:21:51,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 13:21:51,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 13:21:51,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 13:21:51,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 13:21:51,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 13:21:51,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 13:21:51,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 13:21:51,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 13:21:51,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 13:21:51,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 13:21:51,408 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 13:21:51,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 13:21:51,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 13:21:51,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 13:21:51,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 13:21:51,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 13:21:51,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 13:21:51,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 13:21:51,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 13:21:51,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 13:21:51,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 13:21:51,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 13:21:51,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 13:21:51,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 13:21:51,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 13:21:51,412 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 13:21:51,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 13:21:51,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:21:51,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 13:21:51,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 13:21:51,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 13:21:51,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 13:21:51,414 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 13:21:51,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 13:21:51,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 13:21:51,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 13:21:51,424 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 13:21:51,424 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 13:21:51,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 13:21:51,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 13:21:51,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 13:21:51,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 13:21:51,684 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 13:21:51,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-05-06 13:21:52,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 13:21:52,992 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 13:21:52,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-05-06 13:21:53,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/57034833a/89076410f90f45418cdf3de014519c0e/FLAGa1872c057 [2024-05-06 13:21:53,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/57034833a/89076410f90f45418cdf3de014519c0e [2024-05-06 13:21:53,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 13:21:53,024 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 13:21:53,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 13:21:53,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 13:21:53,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 13:21:53,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e7c916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53, skipping insertion in model container [2024-05-06 13:21:53,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 13:21:53,322 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-atomic/dekker.i[31403,31416] [2024-05-06 13:21:53,334 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-atomic/dekker.i[32483,32496] [2024-05-06 13:21:53,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:21:53,352 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 13:21:53,395 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-atomic/dekker.i[31403,31416] [2024-05-06 13:21:53,397 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-atomic/dekker.i[32483,32496] [2024-05-06 13:21:53,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:21:53,423 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:21:53,432 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:21:53,438 INFO L206 MainTranslator]: Completed translation [2024-05-06 13:21:53,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53 WrapperNode [2024-05-06 13:21:53,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 13:21:53,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 13:21:53,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 13:21:53,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 13:21:53,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,468 INFO L138 Inliner]: procedures = 171, calls = 59, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2024-05-06 13:21:53,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 13:21:53,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 13:21:53,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 13:21:53,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 13:21:53,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 13:21:53,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 13:21:53,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 13:21:53,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 13:21:53,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (1/1) ... [2024-05-06 13:21:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:21:53,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:21:53,510 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 13:21:53,527 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 13:21:53,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-06 13:21:53,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-06 13:21:53,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 13:21:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 13:21:53,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 13:21:53,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 13:21:53,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 13:21:53,583 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 13:21:53,673 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 13:21:53,675 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 13:21:53,786 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 13:21:53,795 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 13:21:53,795 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-06 13:21:53,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:21:53 BoogieIcfgContainer [2024-05-06 13:21:53,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 13:21:53,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 13:21:53,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 13:21:53,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 13:21:53,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:21:53" (1/3) ... [2024-05-06 13:21:53,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4470c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:21:53, skipping insertion in model container [2024-05-06 13:21:53,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:21:53" (2/3) ... [2024-05-06 13:21:53,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4470c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:21:53, skipping insertion in model container [2024-05-06 13:21:53,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:21:53" (3/3) ... [2024-05-06 13:21:53,804 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-05-06 13:21:53,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 13:21:53,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 13:21:53,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 13:21:53,817 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 13:21:53,862 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 13:21:53,890 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 13:21:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 13:21:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:21:53,893 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 13:21:53,905 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 13:21:53,927 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 13:21:53,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:53,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 13:21:53,941 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;@1fc96120, 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 13:21:53,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 13:21:53,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:21:53,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 186579822, now seen corresponding path program 1 times [2024-05-06 13:21:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:21:54,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143888883] [2024-05-06 13:21:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-06 13:21:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:21:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143888883] [2024-05-06 13:21:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143888883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:21:54,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:21:54,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 13:21:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989682620] [2024-05-06 13:21:54,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:21:54,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 13:21:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:21:54,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 13:21:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 13:21:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,252 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:21:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 13:21:54,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 13:21:54,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:21:54,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash 235160802, now seen corresponding path program 1 times [2024-05-06 13:21:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:21:54,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233083479] [2024-05-06 13:21:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 13:21:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:21:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233083479] [2024-05-06 13:21:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233083479] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:21:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:21:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 13:21:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623502245] [2024-05-06 13:21:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:21:54,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-06 13:21:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:21:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:21:54,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 13:21:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:21:54,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:21:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 13:21:54,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:21:54,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1672900364, now seen corresponding path program 1 times [2024-05-06 13:21:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:21:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090744793] [2024-05-06 13:21:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:54,660 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 13:21:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:21:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090744793] [2024-05-06 13:21:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090744793] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:21:54,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:21:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-06 13:21:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980189641] [2024-05-06 13:21:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:21:54,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 13:21:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:21:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:21:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 13:21:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,662 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:21:54,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 13:21:54,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:21:54,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-06 13:21:54,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:21:54,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1556961624, now seen corresponding path program 1 times [2024-05-06 13:21:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:21:54,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252360457] [2024-05-06 13:21:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:54,756 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 13:21:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:21:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252360457] [2024-05-06 13:21:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252360457] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:21:54,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:21:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 13:21:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061376980] [2024-05-06 13:21:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:21:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-06 13:21:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:21:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:21:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 13:21:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,758 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:21:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:21:54,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:21:54,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:21:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-06 13:21:54,794 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:21:54,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1049539935, now seen corresponding path program 1 times [2024-05-06 13:21:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:21:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715765426] [2024-05-06 13:21:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 13:21:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:21:54,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715765426] [2024-05-06 13:21:54,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715765426] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:21:54,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:21:54,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 13:21:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038450962] [2024-05-06 13:21:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:21:54,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-06 13:21:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:21:54,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:21:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 13:21:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,856 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:21:54,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:21:54,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:21:54,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:21:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 13:21:54,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-06 13:21:54,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:21:54,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:21:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash -864655943, now seen corresponding path program 1 times [2024-05-06 13:21:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:21:54,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392923968] [2024-05-06 13:21:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 13:21:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:21:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392923968] [2024-05-06 13:21:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392923968] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:21:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:21:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-06 13:21:54,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359025834] [2024-05-06 13:21:54,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:21:54,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 13:21:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:21:54,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:21:54,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 13:21:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:21:54,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:21:54,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:54,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:21:54,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:21:54,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 13:21:54,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:21:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1672900357, now seen corresponding path program 1 times [2024-05-06 13:21:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1425699219, now seen corresponding path program 1 times [2024-05-06 13:21:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2373040, now seen corresponding path program 1 times [2024-05-06 13:21:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:55,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1051640603, now seen corresponding path program 1 times [2024-05-06 13:21:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1933478771, now seen corresponding path program 1 times [2024-05-06 13:21:55,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1647749232, now seen corresponding path program 1 times [2024-05-06 13:21:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:55,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1076721846, now seen corresponding path program 1 times [2024-05-06 13:21:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1805015836, now seen corresponding path program 1 times [2024-05-06 13:21:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -546560193, now seen corresponding path program 1 times [2024-05-06 13:21:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1208734307, now seen corresponding path program 1 times [2024-05-06 13:21:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,557 INFO L85 PathProgramCache]: Analyzing trace with hash -397661995, now seen corresponding path program 1 times [2024-05-06 13:21:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash 98921144, now seen corresponding path program 1 times [2024-05-06 13:21:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 637147782, now seen corresponding path program 1 times [2024-05-06 13:21:56,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 13:21:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 13:21:57,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:21:57,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 13:21:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1917648042, now seen corresponding path program 1 times [2024-05-06 13:21:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 13:21:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 13:21:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 13:21:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-06 13:21:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash -726195153, now seen corresponding path program 1 times [2024-05-06 13:21:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 755535615, now seen corresponding path program 1 times [2024-05-06 13:21:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1400593861, now seen corresponding path program 1 times [2024-05-06 13:21:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -386958989, now seen corresponding path program 1 times [2024-05-06 13:21:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash 169432030, now seen corresponding path program 1 times [2024-05-06 13:21:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -217772560, now seen corresponding path program 1 times [2024-05-06 13:21:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1910657027, now seen corresponding path program 1 times [2024-05-06 13:21:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:58,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1209945771, now seen corresponding path program 1 times [2024-05-06 13:21:59,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 391751571, now seen corresponding path program 1 times [2024-05-06 13:21:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1788415619, now seen corresponding path program 1 times [2024-05-06 13:21:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1997307262, now seen corresponding path program 1 times [2024-05-06 13:21:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1321128709, now seen corresponding path program 1 times [2024-05-06 13:21:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1056162164, now seen corresponding path program 1 times [2024-05-06 13:21:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:21:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:21:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1393767455, now seen corresponding path program 2 times [2024-05-06 13:21:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:59,641 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 13:21:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:21:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:21:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:21:59,667 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 13:21:59,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:21:59,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-05-06 13:22:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash -726195153, now seen corresponding path program 2 times [2024-05-06 13:22:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 755535615, now seen corresponding path program 3 times [2024-05-06 13:22:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1400593861, now seen corresponding path program 2 times [2024-05-06 13:22:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -386958989, now seen corresponding path program 2 times [2024-05-06 13:22:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 169432030, now seen corresponding path program 2 times [2024-05-06 13:22:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,768 INFO L85 PathProgramCache]: Analyzing trace with hash -217772560, now seen corresponding path program 2 times [2024-05-06 13:22:00,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1910657027, now seen corresponding path program 2 times [2024-05-06 13:22:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:00,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1209945771, now seen corresponding path program 2 times [2024-05-06 13:22:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash 391751571, now seen corresponding path program 2 times [2024-05-06 13:22:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1788415619, now seen corresponding path program 2 times [2024-05-06 13:22:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1997307262, now seen corresponding path program 2 times [2024-05-06 13:22:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1321128709, now seen corresponding path program 2 times [2024-05-06 13:22:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137764, now seen corresponding path program 1 times [2024-05-06 13:22:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:01,604 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 13:22:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:01,623 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 13:22:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 13:22:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-05-06 13:22:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash -726195153, now seen corresponding path program 3 times [2024-05-06 13:22:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 755535615, now seen corresponding path program 4 times [2024-05-06 13:22:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1400593861, now seen corresponding path program 3 times [2024-05-06 13:22:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash -386958989, now seen corresponding path program 3 times [2024-05-06 13:22:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash 169432030, now seen corresponding path program 3 times [2024-05-06 13:22:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash -217772560, now seen corresponding path program 3 times [2024-05-06 13:22:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1910657027, now seen corresponding path program 3 times [2024-05-06 13:22:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:02,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1209945771, now seen corresponding path program 3 times [2024-05-06 13:22:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash 391751571, now seen corresponding path program 3 times [2024-05-06 13:22:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1788415619, now seen corresponding path program 3 times [2024-05-06 13:22:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1997307262, now seen corresponding path program 3 times [2024-05-06 13:22:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1321128709, now seen corresponding path program 3 times [2024-05-06 13:22:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 661784930, now seen corresponding path program 1 times [2024-05-06 13:22:03,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:22:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:22:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:03,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,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,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 13:22:03,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:22:03,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:22:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1542276435, now seen corresponding path program 1 times [2024-05-06 13:22:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:22:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203451342] [2024-05-06 13:22:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:22:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 13:22:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:22:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203451342] [2024-05-06 13:22:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203451342] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 13:22:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256782020] [2024-05-06 13:22:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:22:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 13:22:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:22:03,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 13:22:03,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 13:22:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:22:03,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2024-05-06 13:22:03,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 13:22:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 13:22:03,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 13:22:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 13:22:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256782020] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 13:22:03,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 13:22:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-05-06 13:22:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41580506] [2024-05-06 13:22:03,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 13:22:03,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 13:22:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:22:03,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 13:22:03,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-06 13:22:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:03,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:22:03,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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 13:22:03,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:03,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:03,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:03,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:03,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:03,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:03,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:22:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:22:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:22:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:22:04,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 13:22:04,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 13:22:04,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 13:22:04,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 13:22:04,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-06 13:22:04,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 13:22:04,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-06 13:22:05,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2024-05-06 13:22:05,175 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 13:22:05,178 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 13:22:05,178 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 13:22:05,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 01:22:05 BasicIcfg [2024-05-06 13:22:05,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 13:22:05,181 INFO L158 Benchmark]: Toolchain (without parser) took 12156.54ms. Allocated memory was 294.6MB in the beginning and 728.8MB in the end (delta: 434.1MB). Free memory was 220.7MB in the beginning and 653.4MB in the end (delta: -432.7MB). Peak memory consumption was 2.7MB. Max. memory is 8.0GB. [2024-05-06 13:22:05,181 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory was 148.4MB in the beginning and 148.3MB in the end (delta: 66.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 13:22:05,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.01ms. Allocated memory is still 294.6MB. Free memory was 220.5MB in the beginning and 249.0MB in the end (delta: -28.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2024-05-06 13:22:05,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.92ms. Allocated memory is still 294.6MB. Free memory was 249.0MB in the beginning and 246.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 13:22:05,182 INFO L158 Benchmark]: Boogie Preprocessor took 16.86ms. Allocated memory is still 294.6MB. Free memory was 246.9MB in the beginning and 245.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 13:22:05,182 INFO L158 Benchmark]: RCFGBuilder took 310.60ms. Allocated memory is still 294.6MB. Free memory was 245.3MB in the beginning and 230.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-06 13:22:05,182 INFO L158 Benchmark]: TraceAbstraction took 11382.54ms. Allocated memory was 294.6MB in the beginning and 728.8MB in the end (delta: 434.1MB). Free memory was 229.6MB in the beginning and 653.4MB in the end (delta: -423.8MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2024-05-06 13:22:05,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory was 148.4MB in the beginning and 148.3MB in the end (delta: 66.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 411.01ms. Allocated memory is still 294.6MB. Free memory was 220.5MB in the beginning and 249.0MB in the end (delta: -28.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.92ms. Allocated memory is still 294.6MB. Free memory was 249.0MB in the beginning and 246.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.86ms. Allocated memory is still 294.6MB. Free memory was 246.9MB in the beginning and 245.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.60ms. Allocated memory is still 294.6MB. Free memory was 245.3MB in the beginning and 230.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11382.54ms. Allocated memory was 294.6MB in the beginning and 728.8MB in the end (delta: 434.1MB). Free memory was 229.6MB in the beginning and 653.4MB in the end (delta: -423.8MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 37234, independent: 34385, independent conditional: 34095, independent unconditional: 290, dependent: 2849, dependent conditional: 2849, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34898, independent: 34385, independent conditional: 34095, independent unconditional: 290, dependent: 513, dependent conditional: 513, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34898, independent: 34385, independent conditional: 34095, independent unconditional: 290, dependent: 513, dependent conditional: 513, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34898, independent: 34385, independent conditional: 34095, independent unconditional: 290, dependent: 513, dependent conditional: 513, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37066, independent: 34385, independent conditional: 15693, independent unconditional: 18692, dependent: 2681, dependent conditional: 1993, dependent unconditional: 688, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37066, independent: 34385, independent conditional: 9852, independent unconditional: 24533, dependent: 2681, dependent conditional: 688, dependent unconditional: 1993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37066, independent: 34385, independent conditional: 9852, independent unconditional: 24533, dependent: 2681, dependent conditional: 688, dependent unconditional: 1993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1275, independent: 1219, independent conditional: 188, independent unconditional: 1031, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1275, independent: 1212, independent conditional: 0, independent unconditional: 1212, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 72, dependent conditional: 54, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 37066, independent: 33166, independent conditional: 9664, independent unconditional: 23502, dependent: 2625, dependent conditional: 652, dependent unconditional: 1973, unknown: 1275, unknown conditional: 224, unknown unconditional: 1051] , Statistics on independence cache: Total cache size (in pairs): 1275, Positive cache size: 1219, Positive conditional cache size: 188, Positive unconditional cache size: 1031, Negative cache size: 56, Negative conditional cache size: 36, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7146, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37066, independent: 34385, independent conditional: 15693, independent unconditional: 18692, dependent: 2681, dependent conditional: 1993, dependent unconditional: 688, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37066, independent: 34385, independent conditional: 9852, independent unconditional: 24533, dependent: 2681, dependent conditional: 688, dependent unconditional: 1993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37066, independent: 34385, independent conditional: 9852, independent unconditional: 24533, dependent: 2681, dependent conditional: 688, dependent unconditional: 1993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1275, independent: 1219, independent conditional: 188, independent unconditional: 1031, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1275, independent: 1212, independent conditional: 0, independent unconditional: 1212, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 72, dependent conditional: 54, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 37066, independent: 33166, independent conditional: 9664, independent unconditional: 23502, dependent: 2625, dependent conditional: 652, dependent unconditional: 1973, unknown: 1275, unknown conditional: 224, unknown unconditional: 1051] , Statistics on independence cache: Total cache size (in pairs): 1275, Positive cache size: 1219, Positive conditional cache size: 188, Positive unconditional cache size: 1031, Negative cache size: 56, Negative conditional cache size: 36, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7146 ], Independence queries for same thread: 2336 - PositiveResult [Line: 780]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 739]: 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 5 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 10.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 30, 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.6s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 700 SizeOfPredicates, 1 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12/15 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: 8.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 4, ConditionalCommutativityConditionCalculations: 167, ConditionalCommutativityTraceChecks: 54, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 13:22:05,193 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 13:22:05,397 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...